The Optimized Segment Support Map for the Mining of Frequent Patterns
暂无分享,去创建一个
[1] Deok-Hwan Kim,et al. Multi-dimensional selectivity estimation using compressed histogram information , 1999, SIGMOD '99.
[2] S. Zacks. SURVEY OF CLASSICAL AND BAYESIAN APPROACHES TO THE CHANGE-POINT PROBLEM: FIXED SAMPLE AND SEQUENTIAL PROCEDURES OF TESTING AND ESTIMATION11Research supported in part by ONR Contracts N00014-75-0725 at The George Washington University and N00014-81-K-0407 at SUNY-Binghamton. , 1983 .
[3] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[4] Mohammed J. Zaki,et al. Fast vertical mining using diffsets , 2003, KDD '03.
[5] Ramakrishnan Srikant,et al. Mining Association Rules with Item Constraints , 1997, KDD.
[6] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[7] Christian Hidber,et al. Association Rule Mining , 2017 .
[8] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.
[9] Beng Chin Ooi,et al. Global optimization of histograms , 2001, SIGMOD '01.
[10] Rajeev Motwani,et al. Beyond market baskets: generalizing association rules to correlations , 1997, SIGMOD '97.
[11] Ramesh C Agarwal,et al. Depth first generation of long patterns , 2000, KDD '00.
[12] Laks V. S. Lakshmanan,et al. The segment support map: scalable mining of frequent itemsets , 2000, SKDD.
[13] Nicolas Pasquier,et al. Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.
[14] Laks V. S. Lakshmanan,et al. Exploratory mining and pruning optimizations of constrained associations rules , 1998, SIGMOD '98.
[15] Jinyan Li,et al. Efficient mining of emerging patterns: discovering trends and differences , 1999, KDD '99.
[16] Torsten Suel,et al. Optimal Histograms with Quality Guarantees , 1998, VLDB.
[17] Jiawei Han,et al. Efficient mining of partial periodic patterns in time series database , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).
[18] Philip S. Yu,et al. Using a Hash-Based Method with Transaction Trimming for Mining Association Rules , 1997, IEEE Trans. Knowl. Data Eng..
[19] Shamkant B. Navathe,et al. An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.
[20] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[21] Laks V. S. Lakshmanan,et al. Optimization of constrained frequent set queries with 2-variable constraints , 1999, SIGMOD '99.
[22] R. Ng,et al. Exploratory Mining and Pruning Optimizations of Constrained Association Rules , 1998, SIGMOD Conference.
[23] Ramakrishnan Srikant,et al. Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.
[24] Yannis E. Ioannidis,et al. Balancing histogram optimality and practicality for query result size estimation , 1995, SIGMOD '95.
[25] Jennifer Widom,et al. Clustering association rules , 1997, Proceedings 13th International Conference on Data Engineering.
[26] Laks V. S. Lakshmanan,et al. Efficient mining of constrained correlated sets , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[27] Sridhar Ramaswamy,et al. Cyclic association rules , 1998, Proceedings 14th International Conference on Data Engineering.