We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
HUANG Liusheng, CHEN Huaping, WANG Xun, CHEN Guoliang. A Fast Algorithm for Mining Association Rules[J]. Journal of Computer Science and Technology, 2000, 15(6): 619-624.
Citation: HUANG Liusheng, CHEN Huaping, WANG Xun, CHEN Guoliang. A Fast Algorithm for Mining Association Rules[J]. Journal of Computer Science and Technology, 2000, 15(6): 619-624.

A Fast Algorithm for Mining Association Rules

More Information
  • Published Date: November 09, 2000
  • In this paper, the problem of discovering association rules between items in a large database of sales transactions is discussed, and a novel algorithm, BitMatrix, is proposed. The proposed algorithm is fundamentally different from the known algorithms Apriori and AprioriTid. Empirical evaluation shows that the algorithm outperforms the known ones for large databases. Scale-up experiments show that the algorithm scales linearly with the number of transactions.
  • [1]
    Agrawal R, Srikant R. Mining sequential patterns. IBM Research Report, 1995.
    [2]
    Agrawal R, Imielinski T, Swami A. Mining association rules between sets in large the ACM SIGMOD Conf. Management of Data, May 1993, pp.207-216.
    [3]
    Agrawal R, Srikant R. Fast algorithm for mining association rules. IBM Reseanch databases. In Proc. 1994. ……….

Catalog

    Article views (32) PDF downloads (1219) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return