FIMI'03: Workshop on Frequent Itemset Mining Implementations
暂无分享,去创建一个
[1] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.
[2] Philip S. Yu,et al. An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.
[3] Srinivasan Parthasarathy,et al. New Algorithms for Fast Discovery of Association Rules , 1997, KDD.
[4] Charu C. Aggarwal,et al. Towards long pattern generation in dense databases , 2001, SKDD.
[5] Wesley W. Chu,et al. SmartMiner: a depth first algorithm guided by tail information for mining maximal frequent itemsets , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[6] Devavrat Shah,et al. Turbo-charging vertical mining of large databases , 2000, SIGMOD '00.
[7] 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.
[8] Mohammed J. Zaki. Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..
[9] Mohammed J. Zaki,et al. Fast vertical mining using diffsets , 2003, KDD '03.
[10] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.
[11] G. Grahne,et al. High Performance Mining of Maximal Frequent Itemsets Gösta , 2003 .
[12] Anthony K. H. Tung,et al. Carpenter: finding closed patterns in long biological datasets , 2003, KDD '03.
[13] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[14] Zvi M. Kedem,et al. Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set , 1998, EDBT.
[15] K. Vanhoof,et al. Profiling of High-Frequency Accident Locations by Use of Association Rules , 2003 .
[16] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[17] Rajeev Motwani,et al. Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.
[18] Dan A. Simovici,et al. Galois Connections and Data Mining , 2000, J. Univers. Comput. Sci..
[19] Johannes Gehrke,et al. MAFIA: a maximal frequent itemset algorithm for transactional databases , 2001, Proceedings 17th International Conference on Data Engineering.
[20] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[21] Ramesh C Agarwal,et al. Depth first generation of long patterns , 2000, KDD '00.
[22] Arun N. Swami,et al. Set-oriented mining for association rules in relational databases , 1995, Proceedings of the Eleventh International Conference on Data Engineering.
[23] Ron Kohavi,et al. Real world performance of association rule algorithms , 2001, KDD '01.
[24] Gerd Stumme,et al. Mining frequent patterns with counting inference , 2000, SKDD.
[25] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[26] Jun-Lin Lin,et al. Mining association rules: anti-skew algorithms , 1998, Proceedings 14th International Conference on Data Engineering.
[27] Hannu Toivonen,et al. Sampling Large Databases for Association Rules , 1996, VLDB.
[28] Dimitrios Gunopulos,et al. Discovering All Most Specific Sentences by Randomized Algorithms , 1997, ICDT.
[29] Nicolas Pasquier,et al. Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.
[30] Bart Goethals,et al. Efficient frequent pattern mining , 2002 .
[31] Shamkant B. Navathe,et al. An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.
[32] Ferenc Bodon,et al. A fast APRIORI implementation , 2003, FIMI.
[33] Mohammed J. Zaki,et al. Efficiently mining maximal frequent itemsets , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[34] Geert Wets,et al. Using association rules for product assortment decisions: a case study , 1999, KDD '99.
[35] Jian Pei,et al. CLOSET+: searching for the best strategies for mining frequent closed itemsets , 2003, KDD '03.