Mining Frequent Patterns based on Compressed FP-tree without Conditional FP-tree Generation
暂无分享,去创建一个
Ming Li | Shifu Chen | Zhaoqian Chen | Fei Chen | Lin Shang | Ming Li | L. Shang | Zhaoqian Chen | Shifu Chen | Fei Chen
[1] 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).
[2] Petra Perner,et al. Data Mining - Concepts and Techniques , 2002, Künstliche Intell..
[3] Laks V. S. Lakshmanan,et al. Efficient mining of constrained correlated sets , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[4] Tomasz Imielinski,et al. Database Mining: A Performance Perspective , 1993, IEEE Trans. Knowl. Data Eng..
[5] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.
[6] Raj P. Gopalan,et al. CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure , 2004, FIMI.
[7] R. Gopalan,et al. High Performance Frequent Patterns Extraction using Compressed FP-Tree , .
[8] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[9] Yong Qiu,et al. An improved algorithm of mining from FP-tree , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).