Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 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
DualMiner: a dual-pruning algorithm for itemsets with constraints
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
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
Extending the state-of-the-art of constraint-based pattern discovery
Data & Knowledge Engineering
Constraint programming for itemset mining
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining uncertain data for constrained frequent sets
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
uCFS2: an enhanced system that mines uncertain data for constrained frequent sets
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Clustering with relative constraints
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Visual analytics of social networks: mining and visualizing co-authorship networks
FAC'11 Proceedings of the 6th international conference on Foundations of augmented cognition: directing the future of adaptive systems
LGM: mining frequent subgraphs from linear graphs
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Constrained logistic regression for discriminative pattern mining
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
Efficient mining of top correlated patterns based on null-invariant measures
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
A clustering-based visualization of colocation patterns
Proceedings of the 15th Symposium on International Database Engineering & Applications
Finding Strong Groups of Friends among Friends in Social Networks
DASC '11 Proceedings of the 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing
Clustering with Attribute-Level Constraints
ICDM '11 Proceedings of the 2011 IEEE 11th International Conference on Data Mining
Pushing tougher constraints in frequent pattern mining
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
An efficient framework for mining flexible constraints
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A new class of constraints for constrained frequent pattern mining
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Fast tree-based mining of frequent itemsets from uncertain data
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Selecting feature subset via constraint association rules
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
RadialViz: an orientation-free frequent pattern visualizer
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Contrast Data Mining: Concepts, Algorithms, and Applications
Contrast Data Mining: Concepts, Algorithms, and Applications
Mining popular patterns from transactional databases
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
| Hi-index | 0.00 |
Frequent pattern mining searches data for sets of items that are frequently co-occurring together. Most of algorithms find all the frequent patterns. However, there are many real-life situations in which users is interested in only some small portions of the entire collection of frequent patterns. To mine patterns that satisfy the user aggregate constraints in the form of agg(X.attr)θconst, properties of constraints are exploited. When agg is sum, the mining can be complicated. Existing mining systems or algorithms usually make assumptions about the value or range of X.attr and/or const. In this paper, we propose a frequent pattern mining system that avoids making these assumptions and that effectively handles the sum constraints as well as other aggregate constraints.