Mining top-K frequent itemsets through progressive sampling

    Data Mining and Knowledge Discovery, pp. 310-326, 2010.

    Cited by: 33|Bibtex|Views12|Links
    EI
    Keywords:
    SamplingTop-K frequent itemsetsFrequent itemsets miningBloom filtersProgressive sampling

    Abstract:

    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

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments