We use cookies to improve your experience with our site.

Indexed in:

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

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 15 Issue 6
November  2000
Turn off MathJax
Article Contents
Abstract
References
Related Articles
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.
shu

A Fast Algorithm for Mining Association Rules

  • National High Performance Computing Center; Department of Computer Science University of Science & Technology of China; Hefei 230027; P.R. China;

More Information
  • Published Date: November 09, 2000
    Abstract
  • 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.
    • FullText(HTML)
    • References (3)
  • [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. ……….
    • Relative Articles

  • Related Articles

    [1]DU XiaoPing, TANG ShiWei, Akifumi Makinouchi. Maintaining Discovered Frequent Itemsets: Cases for ChangeableDatabase and Support[J]. Journal of Computer Science and Technology, 2003, 18(5).
    [2]HAO Jie, LI Xing. Word Spotting Based on a posterior Measure of Keyword Confidence[J]. Journal of Computer Science and Technology, 2002, 17(4).
    [3]HUANG Liusheng, CHEN Huaping, WANG Xun, CHEN Guoliang. A Fast Algorithm for Mining Associstion Rules[J]. Journal of Computer Science and Technology, 2000, 15(6).
    [4]WAN Yingyu, XU Yinlong, GU Xiaodong, CHEN Guoliang. Efficient Minimum Spanning Tree Algorithms on the Reconfigurable Mesh[J]. Journal of Computer Science and Technology, 2000, 15(2): 116-125.
    [5]MA Jun, YANG Bo, MA Shaohan. A Practical Algorithm for the Minimum Rectilinear Steiner Tree[J]. Journal of Computer Science and Technology, 2000, 15(1): 96-99.
    [6]SHI Weisong, TANG Zhimin, SHI Jinsong. Using Confidence interval to Summarize the Evaluating Results of DSM Systems[J]. Journal of Computer Science and Technology, 2000, 15(1): 73-83.
    [7]Wang Yun, Gu Guanqun. Minimum QOS Parameter Set in Transport Layer[J]. Journal of Computer Science and Technology, 1997, 12(6): 571-573.
    [8]Chen Bin, Hong Jiarong, Wang Yadong. The Minimum Feature Subset Selection Problem[J]. Journal of Computer Science and Technology, 1997, 12(2): 145-153.
    [9]Huang Weikang, F.Lombardi. Repairing VLSI/WSI Redundant Memories with Minimum Cost[J]. Journal of Computer Science and Technology, 1990, 5(2): 187-196.
    [10]Qiao Xiangzhen. An Efficient Parallel Algorithm for FFT[J]. Journal of Computer Science and Technology, 1987, 2(3): 174-190.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (22) PDF downloads (1219) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return