Mining top-K frequent itemsets through progressive sampling
Data Mining and Knowledge Discovery, pp. 310-326, 2010.
SamplingTop-K frequent itemsetsFrequent itemsets miningBloom filtersProgressive sampling
We study the use of sampling for efficiently mining the top-K frequent itemsets of cardinality at most w. To this purpose, we define an approximation to the top-K frequent itemsets to be a family of itemsets which includes (resp., excludes) all very frequent (resp., very infrequent) itemsets, together with an estimate of these itemsets' f...More
PPT (Upload PPT)