Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Optimization of constrained frequent set queries with 2-variable constraints
SIGMOD '99 Proceedings of the 1999 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
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 Item Sets with Convertible Constraints
Proceedings of the 17th International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DualMiner: a dual-pruning algorithm for itemsets with constraints
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Mining of Constrained Correlated Sets
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
ExAMiner: Optimized Level-wise Frequent Pattern Mining with Monotone Constraints
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
On Closed Constrained Frequent Pattern Mining
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Optimization of association rule mining queries
Intelligent Data Analysis
Extending the state-of-the-art of constraint-based pattern discovery
Data & Knowledge Engineering
Mining lossless closed frequent patterns with weight constraints
Knowledge-Based Systems
Efficient mining of weighted interesting patterns with a strong weight and/or support affinity
Information Sciences: an International Journal
An efficient mining of weighted frequent patterns with length decreasing support constraints
Knowledge-Based Systems
A constraint-based querying system for exploratory pattern discovery
Information Systems
On Optimal Rule Mining: A Framework and a Necessary and Sufficient Condition of Antimonotonicity
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
On pushing weight constraints deeply into frequent itemset mining
Intelligent Data Analysis
Mining constraint-based patterns using automatic relaxation
Intelligent Data Analysis
On the Complexity of Constraint-Based Theory Extraction
DS '09 Proceedings of the 12th International Conference on Discovery Science
Ontological support for Association Rule Mining
AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
gPrune: a constraint pushing framework for graph pattern mining
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
On interactive pattern mining from relational databases
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
Efficient mining under rich constraints derived from various datasets
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
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
Mining near-duplicate graph for cluster-based reranking of web video search results
ACM Transactions on Information Systems (TOIS)
Mining pixel evolutions in satellite image time series for agricultural monitoring
ICDM'11 Proceedings of the 11th international conference on Advances in data mining: applications and theoretical aspects
Interestingness is not a dichotomy: introducing softness in constrained pattern mining
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
A relational query primitive for constraint-based pattern mining
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Mining databases and data streams with query languages and rules
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Exploiting virtual patterns for automatically pruning the search space
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
An efficient mining algorithm for maximal weighted frequent patterns in transactional databases
Knowledge-Based Systems
A new class of constraints for constrained frequent pattern mining
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A constrained frequent pattern mining system for handling aggregate constraints
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Optimonotone Measures For Optimal Rule Discovery
Computational Intelligence
Closed and noise-tolerant patterns in n-ary relations
Data Mining and Knowledge Discovery
A Framework for Synthesizing Arbitrary Boolean Queries Induced by Frequent Itemsets
International Journal of Knowledge-Based Organizations
| Hi-index | 0.00 |
In this paper we extend the state-of-art of the constraints that can be pushed in a frequent pattern computation. We introduce a new class of tough constraints, namely Loose Anti-monotone constraints, and we deeply characterize them by showing that they are a superclass of convertible anti-monotone constraints (e.g. constraints on average or median) and that they model tougher constraints (e.g. constraints on variance or standard deviation). Then we show how these constraints can be exploited in a level-wise Apriori-like computation by means of a new data-reduction technique: the resulting algorithm outperforms previous proposals for convertible constraints, and it is to treat much tougher constraints with the same effectiveness of easier ones.