A Study on the Performance of CT-APRIORI and CT-PRO Algorithms usingCompressed Structures for Pattern Mining
暂无分享,去创建一个
[1] Ke Wang,et al. Mining frequent item sets by opportunistic projection , 2002, KDD.
[2] Charu C. Aggarwal,et al. A Tree Projection Algorithm for Generation of Frequent Item Sets , 2001, J. Parallel Distributed Comput..
[3] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[4] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[5] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.
[6] Osmar R. Zaïane,et al. Incremental mining of frequent patterns without candidate generation or support constraint , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..
[7] Jian Pei,et al. Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).
[8] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[9] Wynne Hsu,et al. Integrating Classification and Association Rule Mining , 1998, KDD.
[10] Ian H. Witten,et al. Modeling for text compression , 1989, CSUR.
[11] Christian Borgelt,et al. EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT , 2003 .
[12] Ke Wang,et al. Clustering transactions using large items , 1999, CIKM '99.