Using Loose and Tight Bounds to Mine Frequent Itemsets
暂无分享,去创建一个
[1] Jiawei Han,et al. Discovery of Multiple-Level Association Rules from Large Databases , 1995, VLDB.
[2] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[3] Toon Calders,et al. Deducing Bounds on the Frequency of Itemsets , 2002 .
[4] Laks V. S. Lakshmanan,et al. Mining frequent itemsets with convertible constraints , 2001, Proceedings 17th International Conference on Data Engineering.
[5] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[6] Nicolas Pasquier,et al. Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..
[7] Jean-François Boulicaut,et al. Frequent Closures as a Concise Representation for Binary Data Mining , 2000, PAKDD.
[8] Toon Calders,et al. Mining All Non-derivable Frequent Itemsets , 2002, PKDD.
[9] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.