CoMine: efficient mining of correlated patterns
暂无分享,去创建一个
Jiawei Han | Young-Koo Lee | Y. Dora Cai | Won-Young Kim | Jiawei Han | Y. D. Cai | Young-Koo Lee | Won-Young Kim
[1] 瀬々 潤,et al. Traversing Itemset Lattices with Statistical Metric Pruning (小特集 「発見科学」及び一般演題) , 2000 .
[2] P. Tan,et al. Mining Hyperclique Patterns with Confidence Pruning , 2003 .
[3] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[4] Shinichi Morishita,et al. Transversing itemset lattices with statistical metric pruning , 2000, PODS '00.
[5] Joseph L. Hellerstein,et al. Mining mutually dependent patterns , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[6] Peter J. Rousseeuw,et al. Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .
[7] Rajeev Motwani,et al. Beyond market baskets: generalizing association rules to correlations , 1997, SIGMOD '97.
[8] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[9] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[10] Edward Omiecinski,et al. Alternative Interest Measures for Mining Associations in Databases , 2003, IEEE Trans. Knowl. Data Eng..
[11] Ali S. Hadi,et al. Finding Groups in Data: An Introduction to Chster Analysis , 1991 .