Bifold Constraint-Based Mining by Simultaneous Monotone and Anti-Monotone Checking
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
CanTree: A Tree Structure for Efficient Incremental Mining of Frequent Patterns
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Optimizing Constraint-Based Mining by Automatically Relaxing Constraints
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Distributed Mining of Constrained Patterns from Wireless Sensor Data
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
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
CanTree: a canonical-order tree for incremental frequent-pattern mining
Knowledge and Information Systems
Soft constraint based pattern mining
Data & Knowledge Engineering
Constraint programming for itemset mining
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
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
Efficient mining of interesting weighted patterns from directed graph traversals
Integrated Computer-Aided Engineering
Emerging Cubes: Borders, size estimations and lossless reductions
Information Systems
On pushing weight constraints deeply into frequent itemset mining
Intelligent Data Analysis
Mining constraint-based patterns using automatic relaxation
Intelligent Data Analysis
Reduced representations of Emerging Cubes for OLAP database mining
International Journal of Business Intelligence and Data Mining
On interactive pattern mining from relational databases
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
Constraint-based mining of web page associations
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Approximate weighted frequent pattern mining with/without noisy environments
Knowledge-Based Systems
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
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Prince: an algorithm for generating rule bases without closure computations
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Pushing constraints to detect local patterns
LPD'04 Proceedings of the 2004 international conference on Local Pattern Detection
Local pattern discovery in Array-CGH data
LPD'04 Proceedings of the 2004 international conference on Local Pattern Detection
Efficient mining of association rules based on formal concept analysis
Formal Concept Analysis
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 relational query primitive for constraint-based pattern mining
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
A survey on condensed representations for frequent sets
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Data mining in inductive databases
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
Discovering linguistic patterns using sequence mining
CICLing'12 Proceedings of the 13th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Incorporating occupancy into frequent pattern mining for high quality pattern recommendation
Proceedings of the 21st ACM international conference on Information and knowledge management
Closed and noise-tolerant patterns in n-ary relations
Data Mining and Knowledge Discovery
An efficient method for mining frequent itemsets with double constraints
Engineering Applications of Artificial Intelligence
Para Miner: a generic pattern mining algorithm for multi-core architectures
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
Constrained frequent patterns and closed frequent patterns are two paradigms aimed at reducing the set of extracted patterns to a smaller, more interesting, subset. Although a lot of work has been done with both these paradigms, there is still confusion around the mining problem obtained by joining closed and constrained frequent patterns in a unique framework. In this paper we shed light on this problem by providing a formal definition and a thorough characterization. Wealso study computational issues and show how to combine the most recent results in both paradigms, providing a very efficient algorithm which exploits the two requirements (satisfying constraints and being closed) together at mining time in order to reduce the computation as much as possible.