Efficient algorithms for mining closed itemsets and their lattice structure
暂无分享,去创建一个
[1] Zvi M. Kedem,et al. Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set , 1998, EDBT.
[2] Nicolas Pasquier,et al. Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.
[3] Devavrat Shah,et al. Turbo-charging vertical mining of large databases , 2000, SIGMOD '00.
[4] Shamkant B. Navathe,et al. An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.
[5] Dan A. Simovici,et al. Galois Connections and Data Mining , 2000, J. Univers. Comput. Sci..
[6] Lhouari Nourine,et al. A Fast Algorithm for Building Lattices , 1999, Inf. Process. Lett..
[7] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[8] Mohammed J. Zaki,et al. Efficiently mining maximal frequent itemsets , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[9] Philip S. Yu,et al. An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.
[10] Jian Pei,et al. CLOSET+: searching for the best strategies for mining frequent closed itemsets , 2003, KDD '03.
[11] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.
[12] Jiawei Han,et al. Data Mining: Concepts and Techniques , 2000 .
[13] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[14] Rajeev Motwani,et al. Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.
[15] Ramesh C Agarwal,et al. Depth first generation of long patterns , 2000, KDD '00.
[16] Johannes Gehrke,et al. MAFIA: a maximal frequent itemset algorithm for transactional databases , 2001, Proceedings 17th International Conference on Data Engineering.
[17] Jian Pei,et al. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.
[18] Mohammed J. Zaki,et al. Theoretical Foundations of Association Rules , 2007 .
[19] Mohammed J. Zaki,et al. MIRAGE : A Framework for Mining , Exploring and Visualizing Minimal Association Rules ∗ , 2003 .
[20] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Association Rule Mining , 2007 .
[21] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .
[22] Mohammed J. Zaki,et al. Fast vertical mining using diffsets , 2003, KDD '03.
[23] Heikki Mannila,et al. Verkamo: Fast Discovery of Association Rules , 1996, KDD 1996.
[24] Nandit Soparkar,et al. Data organization and access for efficient data mining , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).
[25] Mohammed J. Zaki. Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..
[26] Mohammed J. Zaki. Generating non-redundant association rules , 2000, KDD '00.
[27] Gerd Stumme,et al. Mining frequent patterns with counting inference , 2000, SKDD.