Knowledge and Information Systems
暂无分享,去创建一个
Zhan Li | Carson Kai-Sang Leung | Quamrul I. Khan | Tariqul Hoque | C. Leung | Q. I. Khan | Zhan Li | T. Hoque
[1] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.
[2] Jia-Ling Koh,et al. An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures1 , 2004, DASFAA.
[3] Philip S. Yu,et al. Using a Hash-Based Method with Transaction Trimming for Mining Association Rules , 1997, IEEE Trans. Knowl. Data Eng..
[4] Bart Goethals,et al. Advances in frequent itemset mining implementations: report on FIMI'03 , 2004, SKDD.
[5] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .
[6] Osmar R. Zaïane,et al. Incremental mining of frequent patterns without candidate generation or support constraint , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..
[7] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[8] Laks V. S. Lakshmanan,et al. Exploiting succinct constraints using FP-trees , 2002, SKDD.
[9] Andrea Pietracaprina,et al. Mining Frequent Itemsets using Patricia Tries , 2003, FIMI.
[10] Ee-Peng Lim,et al. FSSM: Fast Construction of the Optimized Segment Support Map , 2003, DaWaK.
[11] Yasuhiko Morimoto,et al. Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization , 1996, SIGMOD '96.
[12] Ming-Syan Chen,et al. A statistical framework for mining substitution rules , 2005, Knowledge and Information Systems.
[13] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[14] Jiawei Han,et al. Maintenance of discovered association rules in large databases: an incremental updating technique , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[15] Carson Kai-Sang Leung,et al. Interactive constrained frequent-pattern mining system , 2004, Proceedings. International Database Engineering and Applications Symposium, 2004. IDEAS '04..
[16] Heikki Mannila,et al. OSSM: a segmentation approach to optimize frequency counting , 2002, Proceedings 18th International Conference on Data Engineering.
[17] Philip Yu,et al. WAR: Weighted association rules for item intensities , 2007, Knowledge and Information Systems.
[18] 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).
[19] Laks V. S. Lakshmanan,et al. Exploratory mining and pruning optimizations of constrained associations rules , 1998, SIGMOD '98.
[20] Sunita Sarawagi,et al. Integrating association rule mining with relational database systems: alternatives and implications , 1998, SIGMOD '98.
[21] Jianyong Wang,et al. Efficient closed pattern mining in the presence of tough block constraints , 2004, KDD.
[22] Carson Kai-Sang Leung,et al. CanTree: a tree structure for efficient incremental mining of frequent patterns , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).
[23] Jiawei Han,et al. TSP: mining top-K closed sequential patterns , 2003, Third IEEE International Conference on Data Mining.
[24] Laks V. S. Lakshmanan,et al. Mining frequent itemsets with convertible constraints , 2001, Proceedings 17th International Conference on Data Engineering.
[25] Chris Clifton,et al. Query flocks: a generalization of association-rule mining , 1998, SIGMOD '98.
[26] Francesco Bonchi,et al. On closed constrained frequent pattern mining , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).
[27] Daniel Kifer,et al. DualMiner: A Dual-Pruning Algorithm for Itemsets with Constraints , 2002, Data Mining and Knowledge Discovery.
[28] MotwaniRajeev,et al. Beyond market baskets , 1997 .
[29] Dino Pedreschi,et al. Efficient breadth-first mining of frequent pattern with monotone constraints , 2005, Knowledge and Information Systems.
[30] Necip Fazil Ayan,et al. An efficient algorithm to update large itemsets with early pruning , 1999, KDD '99.
[31] MorishitaShinichi,et al. Data mining using two-dimensional optimized association rules , 1996 .
[32] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.
[33] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[34] S YuPhilip,et al. Using a Hash-Based Method with Transaction Trimming for Mining Association Rules , 1997 .
[35] David Wai-Lok Cheung,et al. A General Incremental Technique for Maintaining Discovered Association Rules , 1997, DASFAA.
[36] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[37] Rajeev Motwani,et al. Beyond market baskets: generalizing association rules to correlations , 1997, SIGMOD '97.
[38] Laks V. S. Lakshmanan,et al. Efficient dynamic mining of constrained frequent sets , 2003, TODS.
[39] 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.
[40] Xindong Wu,et al. Association analysis with one scan of databases , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[41] Bart Goethals,et al. Advances in Frequent Itemset Mining Implementations: Introduction to FIMI03 , 2003, FIMI.
[42] Christian Hidber,et al. Association Rule Mining , 2017 .
[43] Srinivasan Parthasarathy,et al. MotifMiner: Efficient discovery of common substructures in biochemical molecules , 2005, Knowledge and Information Systems.
[44] AgrawalRakesh,et al. Integrating association rule mining with relational database systems , 1998 .