Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Constraint-Based Rule Mining in Large, Dense Databases
Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining Free Itemsets under Constraints
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Efficient Mining of Constrained Correlated Sets
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
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
CanTree: a canonical-order tree for incremental frequent-pattern mining
Knowledge and Information Systems
An EffectiveMulti-Layer Model for Controlling the Quality of Data
IDEAS '07 Proceedings of the 11th International Database Engineering and Applications Symposium
Finding frequent items in probabilistic data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
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
Mining frequent conjunctive queries in star schemas
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Mining uncertain data for constrained frequent sets
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Mining frequent itemsets from uncertain data
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Mining uncertain data for frequent itemsets that satisfy aggregate constraints
Proceedings of the 2010 ACM Symposium on Applied Computing
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
Efficient algorithms for the mining of constrained frequent patterns from uncertain data
ACM SIGKDD Explorations Newsletter
Probabilistic spatial queries on existentially uncertain data
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Improved travel time prediction algorithms for intelligent transportation systems
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
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
A constrained frequent pattern mining system for handling aggregate constraints
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Mining probabilistic datasets vertically
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Constrained frequent pattern mining on univariate uncertain data
Journal of Systems and Software
Discovering frequent itemsets on uncertain data: a systematic review
MLDM'13 Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition
| Hi-index | 0.01 |
Frequent set mining searches for sets of items that are frequently co-occurring together. Existing algorithms mainly find all the frequent sets from precise data. However, there are real-life situations in which users are interested in only some tiny portions of the entire collection of frequent sets and/or the data to be mined are uncertain. Recently, a tree-based system was proposed to mine uncertain data for frequent sets that satisfy user-specified succinct constraints. However, non-succinct constraints exist. In this paper, we extend such a system to mine uncertain data for frequent sets that satisfy succinct as well as non-succinct constraints by effectively exploiting properties of these constraints.