Can we push more constraints into frequent pattern mining?
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent patterns by pattern-growth: methodology and implications
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
Scalable frequent-pattern mining methods: an overview
Tutorial notes of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Constrained frequent pattern mining: a pattern-growth view
ACM SIGKDD Explorations Newsletter
Exploiting succinct constraints using FP-trees
ACM SIGKDD Explorations Newsletter
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)
Maintaining discovered frequent itemsets: cases for changeable database and support
Journal of Computer Science and Technology
Pushing Convertible Constraints in Frequent Itemset Mining
Data Mining and Knowledge Discovery
Mining Constrained Gradients in Large Databases
IEEE Transactions on Knowledge and Data Engineering
Mining Frequent Itemsets without Support Threshold: With and without Item Constraints
IEEE Transactions on Knowledge and Data Engineering
TAPER: A Two-Step Approach for All-Strong-Pairs Correlation Query in Large Databases
IEEE Transactions on Knowledge and Data Engineering
On condensed representations of constrained frequent patterns
Knowledge and Information Systems
Finding highly correlated pairs efficiently with powerful pruning
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Mining maximal hyperclique pattern: A hybrid search strategy
Information Sciences: an International Journal
Extending the state-of-the-art of constraint-based pattern discovery
Data & Knowledge Engineering
Constraint-based sequential pattern mining: the pattern-growth methods
Journal of Intelligent Information Systems
Intelligent Data Analysis
Efficient mining of weighted interesting patterns with a strong weight and/or support affinity
Information Sciences: an International Journal
Interactive visual exploration of association rules with rule-focusing methodology
Knowledge and Information Systems
Optimization of association rule mining queries
Intelligent Data Analysis
A data mining proxy approach for efficient frequent itemset mining
The VLDB Journal — The International Journal on Very Large Data Bases
Association Mining in Large Databases: A Re-examination of Its Measures
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Deriving strong association mining rules using a dependency criterion, the lift measure
International Journal of Data Analysis Techniques and Strategies
Mining frequent trajectory patterns in spatial-temporal databases
Information Sciences: an International Journal
Multi-level Frequent Pattern Mining
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Efficient algorithms for mining constrained frequent patterns from uncertain data
Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
Extracting Decision Correlation Rules
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Mining uncertain data for constrained frequent sets
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Mining association rules with multi-dimensional constraints
Journal of Systems and Software
Mining uncertain data for frequent itemsets that satisfy aggregate constraints
Proceedings of the 2010 ACM Symposium on Applied Computing
Efficient algorithms for the mining of constrained frequent patterns from uncertain data
ACM SIGKDD Explorations Newsletter
MCFPTree: An FP-tree-based algorithm for multi-constraint patterns discovery
International Journal of Business Intelligence and Data Mining
Re-examination of interestingness measures in pattern mining: a unified framework
Data Mining and Knowledge Discovery
uCFS2: an enhanced system that mines uncertain data for constrained frequent sets
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Distributed mining of constrained frequent sets from uncertain data
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
An efficient algorithm for mining string databases under constraints
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Pushing constraints to detect local patterns
LPD'04 Proceedings of the 2004 international conference on Local Pattern Detection
Pushing tougher constraints in frequent pattern mining
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Discriminatory confidence analysis in pattern mining
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part I
Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing
Fundamenta Informaticae
Constrained frequent pattern mining on univariate uncertain data
Journal of Systems and Software
Constrained Cube Lattices for Multidimensional Database Mining
International Journal of Data Warehousing and Mining
ICDM'13 Proceedings of the 13th international conference on Advances in Data Mining: applications and theoretical aspects
Editorial: Parameter-free classification in multi-class imbalanced data sets
Data & Knowledge Engineering
| Hi-index | 0.00 |
In this paper, we study the problem of efficiently computing correlated itemsets satisfying given constraints. We call them valid correlated itemsets. It turns out constraints can have subtle interactions with correlated itemsets, depending on their underlying properties. We show that in general the set of minimal valid correlated itemsets does not coincide with that of minimal correlated itemsets that are valid, and characterize classes of constraints for which these sets coincide. We delineate the meaning of these two spaces and give algorithms for computing them. We also give an analytical evaluation of their performance and validate our analysis with a detailed experimental evaluation.