Mining Colossal Frequent Patterns by Core Pattern Fusion
暂无分享,去创建一个
Philip S. Yu | Jiawei Han | Hong Cheng | Xifeng Yan | Feida Zhu | Jiawei Han | Hong Cheng | Xifeng Yan | Feida Zhu
[1] Gösta Grahne,et al. Efficiently Using Prefix-trees in Mining Frequent Itemsets , 2003, FIMI.
[2] Dimitrios Gunopulos,et al. Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS.
[3] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[4] Ke Wang,et al. Mining frequent item sets by opportunistic projection , 2002, KDD.
[5] Anthony K. H. Tung,et al. Carpenter: finding closed patterns in long biological datasets , 2003, KDD '03.
[6] AgrawalRakesh,et al. Mining association rules between sets of items in large databases , 1993 .
[7] Mohammed J. Zaki,et al. Efficiently mining maximal frequent itemsets , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[8] Hiroki Arimura,et al. LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets , 2004, FIMI.
[9] Jian Pei,et al. CLOSET+: searching for the best strategies for mining frequent closed itemsets , 2003, KDD '03.
[10] Johannes Gehrke,et al. MAFIA: a maximal frequent itemset algorithm for transactional databases , 2001, Proceedings 17th International Conference on Data Engineering.
[11] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.
[12] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[13] Jiawei Han,et al. Mining Compressed Frequent-Pattern Sets , 2005, VLDB.
[14] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.
[15] Rajeev Motwani,et al. Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.
[16] Jiawei Han,et al. TFP: an efficient algorithm for mining top-k frequent closed itemsets , 2005, IEEE Transactions on Knowledge and Data Engineering.
[17] Heikki Mannila,et al. Efficient Algorithms for Discovering Association Rules , 1994, KDD Workshop.
[18] Anthony K. H. Tung,et al. Mining top-K covering rule groups for gene expression data , 2005, SIGMOD '05.
[19] Hannu Toivonen,et al. Sampling Large Databases for Association Rules , 1996, VLDB.
[20] Dimitrios Gunopulos,et al. Discovering All Most Specific Sentences by Randomized Algorithms , 1997, ICDT.
[21] Nicolas Pasquier,et al. Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.
[22] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.
[23] Thomas J. Ostrand,et al. Experiments on the effectiveness of dataflow- and control-flow-based test adequacy criteria , 1994, Proceedings of 16th International Conference on Software Engineering.