2009 · 10 citations · 20 references
ComputingComputer ScienceData MiningDatabasesStatisticsEstimation TheoryFrequent Pattern MiningSample SizeSampling MethodsSampling TechniquesSampling TheoryFrequent Itemset MiningMaximal Frequent Itemset Mining
Estimating the number of frequent itemsets for minimal support α in a large dataset is of great interest from both theoretical and practical perspectives. However, finding not only the number of frequent itemsets, but even the number of maximal frequent itemsets, is #P-complete. In this study, we provide a theoretical investigation on the sampling estimator. We discover and prove several fundamental but also rather surprising properties of the sampling estimator. We also propose a novel algorithm to estimate the number of frequent itemsets without using sampling. Our detailed experimental results have shown the accuracy and efficiency of our proposed approach.
20
Fast algorithms for mining association rules
Rakesh Agrawal, Ramakrishnan Srikant · 1998 · 10.8K citations
Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · ACM SIGMOD Record · 2000 · 6.4K citations
Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · 2000 · 3.2K citations · Full text
Fast discovery of association rules
Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant et al. · Knowledge Discovery and Data Mining · 1996 · 2.3K citations