A condensed representation to find frequent patterns
暂无分享,去创建一个
[1] Heikki Mannila,et al. Multiple Uses of Frequent Sets and Condensed Representations (Extended Abstract) , 1996, KDD.
[2] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.
[3] 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.
[4] Nicolas Pasquier,et al. Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..
[5] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[6] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[7] Hannu Toivonen,et al. Sampling Large Databases for Association Rules , 1996, VLDB.
[8] Charu C. Aggarwal,et al. A Tree Projection Algorithm for Generation of Frequent Item Sets , 2001, J. Parallel Distributed Comput..
[9] Jean-François Boulicaut,et al. Approximation of Frequency Queris by Means of Free-Sets , 2000, PKDD.
[10] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.