Fast discovery of association rules
Advances in knowledge discovery and data mining
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient mining of association rules using closed itemset lattices
Information Systems
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A tree projection algorithm for generation of frequent item sets
Journal of Parallel and Distributed Computing - Special issue on high-performance data mining
Levelwise Search and Borders of Theories in KnowledgeDiscovery
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
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Mining All Non-derivable Frequent Itemsets
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Using Condensed Representations for Interactive Association Rule Mining
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
The Closed Keys Base of Frequent Itemsets
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators
PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Constraint-Based Discovery and Inductive Queries: Application to Association Rule Mining
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
Dataless Transitions Between Concise Representations of Frequent Patterns
Journal of Intelligent Information Systems
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
DBC: a condensed representation of frequent patterns for efficient mining
Information Systems
On support thresholds in associative classification
Proceedings of the 2004 ACM symposium on Applied computing
Reducing borders of k-disjunction free representations of frequent patterns
Proceedings of the 2004 ACM symposium on Applied computing
Essential classification rule sets
ACM Transactions on Database Systems (TODS)
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast and Memory Efficient Mining of Frequent Closed Itemsets
IEEE Transactions on Knowledge and Data Engineering
A Thorough Experimental Study of Datasets for Frequent Itemsets
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
ACM Computing Surveys (CSUR)
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Data Mining and Knowledge Discovery
Efficient mining of understandable patterns from multivariate interval time series
Data Mining and Knowledge Discovery
The implication problem for measure-based constraints
Information Systems
Discovering shared conceptualizations in folksonomies
Web Semantics: Science, Services and Agents on the World Wide Web
Negative Generator Border for Effective Pattern Maintenance
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
An improved data mining approach using predictive itemsets
Expert Systems with Applications: An International Journal
A new concise representation of frequent itemsets using generators and a positive border
Knowledge and Information Systems
Models for association rules based on clustering and correlation
Intelligent Data Analysis
Closures of Downward Closed Representations of Frequent Patterns
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
International Journal of Data Analysis Techniques and Strategies
Data & Knowledge Engineering
Non-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
A new classification of datasets for frequent itemsets
Journal of Intelligent Information Systems
Mining correct properties in incomplete databases
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
Compressed disjunction-free pattern representation versus essential pattern representation
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Yet another approach for completing missing values
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Theoretical bounds on the size of condensed representations
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
An automata approach to pattern collections
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Implicit enumeration of patterns
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Essential patterns: a perfect cover of frequent patterns
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Efficient mining of association rules based on formal concept analysis
Formal Concept Analysis
Extraction of frequent few-overlapped monotone DNF formulas with depth-first pruning
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A survey on condensed representations for frequent sets
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Finding minimum representative pattern sets
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
ACM Transactions on Knowledge Discovery from Data (TKDD)
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
| Hi-index | 0.00 |
Given a large set of data, a common data mining problem is to extract the frequent patterns occurring in this set. The idea presented in this paper is to extract a condensed representation of the frequent patterns called disjunction-free sets, instead of extracting the whole frequent pattern collection. We show that this condensed representation can be used to regenerate all frequent patterns and their exact frequencies. Moreover, this regeneration can be performed without any access to the original data. Practical experiments show that this representation can be extracted very efficiently even in difficult cases. We compared it with another representation of frequent patterns previously investigated in the literature called frequent closed sets. In nearly all experiments we have run, the disjunction-free sets have been extracted much more efficiently than frequent closed sets.