ExAnte: a preprocessing method for frequent-pattern mining
暂无分享,去创建一个
Dino Pedreschi | Francesco Bonchi | Fosca Giannotti | Alessio Mazzanti | D. Pedreschi | F. Giannotti | F. Bonchi | Alessio Mazzanti
[1] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[2] Dino Pedreschi,et al. ExAnte: Anticipated Data Reduction in Constrained Pattern Mining , 2003, PKDD.
[3] Takashi Washio,et al. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.
[4] Jian Pei,et al. Can we push more constraints into frequent pattern mining? , 2000, KDD '00.
[5] Jian Pei,et al. CMAR: accurate and efficient classification based on multiple class-association rules , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[6] Philip S. Yu,et al. MaPle: a fast algorithm for maximal pattern-based clustering , 2003, Third IEEE International Conference on Data Mining.
[7] Bart Goethals,et al. FP-Bonsai: The Art of Growing and Pruning Small FP-Trees , 2004, PAKDD.
[8] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[9] Wynne Hsu,et al. Integrating Classification and Association Rule Mining , 1998, KDD.
[10] Jean-François Boulicaut,et al. Optimization of association rule mining queries , 2002, Intell. Data Anal..
[11] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[12] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.
[13] Man Lung Yiu,et al. Frequent-pattern based iterative projected clustering , 2003, Third IEEE International Conference on Data Mining.
[14] Dino Pedreschi,et al. ExAMiner: optimized level-wise frequent pattern mining with monotone constraints , 2003, Third IEEE International Conference on Data Mining.
[15] Laks V. S. Lakshmanan,et al. Optimization of constrained frequent set queries with 2-variable constraints , 1999, SIGMOD '99.