On the representation and querying of sets of possible worlds
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast discovery of association rules
Advances in knowledge discovery and data mining
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Exploiting succinct constraints using FP-trees
ACM SIGKDD Explorations Newsletter
Mining Frequent Item Sets with Convertible Constraints
Proceedings of the 17th International Conference on Data Engineering
H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Data Mining: Concepts and Algorithms From Multimedia to Bioinformatics
Data Mining: Concepts and Algorithms From Multimedia to Bioinformatics
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
Efficient dynamic mining of constrained frequent sets
ACM Transactions on Database Systems (TODS)
Pushing Convertible Constraints in Frequent Itemset Mining
Data Mining and Knowledge Discovery
Density-based clustering of uncertain data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
ACM SIGMOD Record
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Efficient query evaluation on probabilistic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient Mining of Frequent Patterns from Uncertain Data
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Finding frequent items in probabilistic data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Approximation algorithms for clustering uncertain data
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finding frequent items in data streams
Proceedings of the VLDB Endowment
Managing and Mining Uncertain Data
Managing and Mining Uncertain Data
A Survey of Uncertain Data Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
Mining of Frequent Itemsets from Streams of Uncertain Data
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Frequent pattern mining with uncertain data
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Probabilistic frequent itemset mining in uncertain databases
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient algorithms for mining constrained frequent patterns from uncertain data
Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
Naive Bayes Classification of Uncertain Data
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
Mining frequent itemsets from uncertain data
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
A Bayesian classifier for uncertain data
Proceedings of the 2010 ACM Symposium on Applied Computing
Mining uncertain data for frequent itemsets that satisfy aggregate constraints
Proceedings of the 2010 ACM Symposium on Applied Computing
A decremental approach for mining frequent itemsets from uncertain data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
A tree-based approach for frequent pattern mining from uncertain data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Encyclopedia of Database Systems
Encyclopedia of Database Systems
Efficient algorithms for the mining of constrained frequent patterns from uncertain data
ACM SIGKDD Explorations Newsletter
Mining uncertain data with probabilistic guarantees
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Guest Editors' Introduction: Special Section on Mining Large Uncertain and Probabilistic Databases
IEEE Transactions on Knowledge and Data Engineering
Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index
IEEE Transactions on Knowledge and Data Engineering
Data Mining and Knowledge Discovery Handbook
Data Mining and Knowledge Discovery Handbook
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Probabilistic spatial queries on existentially uncertain data
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Models for incomplete and probabilistic information
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Efficient pattern mining of uncertain data with sampling
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Frequent pattern mining from time-fading streams of uncertain data
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Mining frequent patterns from univariate uncertain data
Data & Knowledge Engineering
A landmark-model based system for mining frequent patterns from uncertain data streams
Proceedings of the 15th Symposium on International Database Engineering & Applications
Mining probabilistic datasets vertically
Proceedings of the 16th International Database Engineering & Applications Sysmposium
FARP: Mining fuzzy association rules from a probabilistic quantitative database
Information Sciences: an International Journal
| Hi-index | 0.00 |
As an important data mining and knowledge discovery task, association rule mining searches for implicit, previously unknown, and potentially useful pieces of information—in the form of rules revealing associative relationships—that are embedded in the data. In general, the association rule mining process comprises two key steps. The first key step, which mines frequent patterns (i.e., frequently occurring sets of items) from data, is more computationally intensive than the second key step of using the mined frequent patterns to form association rules. In the early days, many developed algorithms mined frequent patterns from traditional transaction databases of precise data such as shopping market basket data, in which the contents of databases are known. However, we are living in an uncertain world, in which uncertain data can be found almost everywhere. Hence, in recent years, researchers have paid more attention to frequent pattern mining from probabilistic databases of uncertain data. In this paper, we review recent algorithmic development on mining uncertain data in these probabilistic databases for frequent patterns. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 316–329 DOI: 10.1002/widm.31