Knowledge and Information Systems · 2012 · 20 citations · 33 references
ComputingComputer ScienceData MiningDatabasesUncertainty QuantificationData ModelingFrequent Pattern MiningProbabilistic ModelingUncertainty ReasoningUncertainty RepresentationAttribute UncertaintyFrequent Itemset MiningPoisson DistributionUncertain Data ModelingUncertain DatabasesUncertain Frequent Pattern MiningWorld Semantics
Data uncertainty is inherent in emerging applications such as location-based services, sensor monitoring systems, and data integration. To handle a large amount of imprecise information, uncertain databases have been recently developed. In this paper, we study how to efficiently discover frequent itemsets from large uncertain databases, interpreted under the Possible World Semantics. This is technically challenging, since an uncertain database induces an exponential number of possible worlds. To tackle this problem, we propose a novel methods to capture the itemset mining process as a probability distribution function taking two models into account: the Poisson distribution and the normal distribution. These model-based approaches extract frequent itemsets with a high degree of accuracy and support large databases. We apply our techniques to improve the performance of the algorithms for (1) finding itemsets whose frequentness probabilities are larger than some threshold and (2) mining itemsets with the $$k$$ highest frequentness probabilities. Our approaches support both tuple and attribute uncertainty models, which are commonly used to represent uncertain databases. Extensive evaluation on real and synthetic datasets shows that our methods are highly accurate and four orders of magnitudes faster than previous approaches. In further theoretical and experimental studies, we give an intuition which model-based approach fits best to different types of data sets.
33
Mining association rules between sets of items in large databases
Rakesh Agrawal, Tomasz Imieliński, Arun Swami · 1993 · 14.8K citations · Full text
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
Efficient query evaluation on probabilistic databases
Nilesh Dalvi, Dan Suciu · The VLDB Journal · 2006 · 979 citations