Knowledge discovery in databases: an overview
AI Magazine
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
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
Using association rules for product assortment decisions: a case study
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining association rules with multiple minimum supports
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
A condensed representation to find frequent patterns
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Mining frequent patterns with counting inference
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
Real world performance of association rule algorithms
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Mining generalised disjunctive association rules
Proceedings of the tenth international conference on Information and knowledge management
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Applications of Data Mining to Electronic Commerce
Data Mining and Knowledge Discovery
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Data Mining and Knowledge Discovery
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Mining All Non-derivable Frequent Itemsets
PKDD '02 Proceedings of the 6th European Conference on Principles of 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 Generalized Association Rules
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The Closed Keys Base of Frequent Itemsets
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Mining Free Itemsets under Constraints
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
CL '00 Proceedings of the First International Conference on Computational Logic
Mining association rules on significant rare data using relative support
Journal of Systems and Software
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Carpenter: finding closed patterns in long biological datasets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
DBC: a condensed representation of frequent patterns for efficient mining
Information Systems
Data Mining Techniques: For Marketing, Sales, and Customer Relationship Management
Data Mining Techniques: For Marketing, Sales, and Customer Relationship Management
Upper Bound on the Length of Generalized Disjunction-Free Patterns
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Mining with rarity: a unifying framework
ACM SIGKDD Explorations Newsletter - Special issue on learning from imbalanced datasets
Advances in frequent itemset mining implementations: report on FIMI'03
ACM SIGKDD Explorations Newsletter - Special issue on learning from imbalanced datasets
Efficient mining of both positive and negative association rules
ACM Transactions on Information Systems (TOIS)
Mining Non-Redundant Association Rules
Data Mining and Knowledge Discovery
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
IEEE Transactions on Knowledge and Data Engineering
Essential classification rule sets
ACM Transactions on Database Systems (TODS)
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure
IEEE Transactions on Knowledge and Data Engineering
Relative risk and odds ratio: a data mining perspective
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Data Mining for Inventory Item Selection with Cross-Selling Considerations
Data Mining and Knowledge Discovery
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Mining condensed frequent-pattern bases
Knowledge and Information Systems
Theory of Relational Databases
Theory of Relational Databases
From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules
CIT '05 Proceedings of the The Fifth International Conference on Computer and Information Technology
IEEE Transactions on Knowledge and Data Engineering
ACM Computing Surveys (CSUR)
Interestingness measures for data mining: A survey
ACM Computing Surveys (CSUR)
On condensed representations of constrained frequent patterns
Knowledge and Information Systems
Frequent closed itemset based algorithms: a thorough structural and analytical survey
ACM SIGKDD Explorations Newsletter
BLOSOM: a framework for mining arbitrary boolean expressions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Constraining and summarizing association rules in medical data
Knowledge and Information Systems
On Mining Instance-Centric Classification Rules
IEEE Transactions on Knowledge and Data Engineering
Towards multidimensional subspace skyline analysis
ACM Transactions on Database Systems (TODS)
\delta-Tolerance Closed Frequent Itemsets
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Quality Measures in Data Mining (Studies in Computational Intelligence)
Quality Measures in Data Mining (Studies in Computational Intelligence)
The Minimum Description Length Principle (Adaptive Computation and Machine Learning)
The Minimum Description Length Principle (Adaptive Computation and Machine Learning)
On compressing frequent patterns
Data & Knowledge Engineering
Horn axiomatizations for sequential data
Theoretical Computer Science
Data Mining and Knowledge Discovery
Constraint-based concept mining and its application to microarray data analysis
Intelligent Data Analysis
Frequent Closed Sequence Mining without Candidate Maintenance
IEEE Transactions on Knowledge and Data Engineering
Frequent pattern mining: current status and future directions
Data Mining and Knowledge Discovery
Mining statistically important equivalence classes and delta-discriminative emerging patterns
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Generalizing the notion of confidence
Knowledge and Information Systems
A recursive search algorithm for statistical disclosure assessment
Data Mining and Knowledge Discovery
Redundant association rules reduction techniques
International Journal of Business Intelligence and Data Mining
Efficient mining of frequent sequence generators
Proceedings of the 17th international conference on World Wide Web
The Journal of Machine Learning Research
Adequate condensed representations of patterns
Data Mining and Knowledge Discovery
Mining conjunctive sequential patterns
Data Mining and Knowledge Discovery
Mining Frequent Closed Unordered Trees Through Natural Representations
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
A new concise representation of frequent itemsets using generators and a positive border
Knowledge and Information Systems
Mining software repositories for software change impact analysis: a case study
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
FOGGER: an algorithm for graph generator discovery
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Mining non-derivable frequent itemsets over data stream
Data & Knowledge Engineering
ACM Computing Surveys (CSUR)
Closures of Downward Closed Representations of Frequent Patterns
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
Minimum description length principle: generators are preferable to closed patterns
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Data & Knowledge Engineering
A new generic basis of "factual" and "implicative" association rules
Intelligent Data Analysis
Efficient itemset generator discovery over a stream sliding window
Proceedings of the 18th ACM conference on Information and knowledge management
The GUHA method and its meaning for data mining
Journal of Computer and System Sciences
Closure spaces that are not uniquely generated
Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
A novel manufacturing defect detection method using association rule mining techniques
Expert Systems with Applications: An International Journal
Mining association rules with multi-dimensional constraints
Journal of Systems and Software
About the lossless reduction of the minimal generator family of a context
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Using disjunctions in association mining
ICDM'07 Proceedings of the 7th industrial conference on Advances in data mining: theoretical aspects and applications
Feature construction based on closedness properties is not that simple
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
About keys of formal context and conformal hypergraph
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
On the complexity of computing generators of closed sets
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Compressed disjunction-free pattern representation versus essential pattern representation
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection
Mining monolingual and bilingual corpora
Intelligent Data Analysis
Generalization of association rules through disjunction
Annals of Mathematics and Artificial Intelligence
Theoretical bounds on the size of condensed representations
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Itemset support queries using frequent itemsets and their condensed representations
DS'06 Proceedings of the 9th international conference on Discovery Science
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
MFIS—Mining frequent itemsets on data streams
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Prince: an algorithm for generating rule bases without closure computations
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Essential patterns: a perfect cover of frequent patterns
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Finding sporadic rules using apriori-inverse
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
Mining succinct systems of minimal generators of formal concepts
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
On computing the minimal generator family for concept lattices and icebergs
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Strong Compound-Risk Factors: Efficient Discovery Through Emerging Patterns and Contrast Sets
IEEE Transactions on Information Technology in Biomedicine
Paper: Modeling by shortest data description
Automatica (Journal of IFAC)
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
Hi-index | 0.00 |
The last years witnessed an explosive progress in networking, storage, and processing technologies resulting in an unprecedented amount of digitalization of data. Hence, there has been a considerable need for tools or techniques to delve and efficiently discover valuable, non-obvious information from large databases. In this situation, data mining is an important research field which offers efficient solutions for such an extraction. Much research in data mining from large databases have focused on the discovery of frequent patterns which are then used to identify relationships between sets of items in a database, through for example association rule derivation. In practice, however, the number of frequently occurring patterns is very large, hampering their effective exploitation by the end-users. In this situation, many works have been interested in defining manageably-sized sets of patterns, called concise representations, from which redundant patterns can be regenerated. In this paper, we concentrate on exact concise representations of frequent patterns. Thus, we describe their close relation with important concepts like the framework of ε-adequate representation and the minimum description length principle. Based on the mathematical settings of Formal Concept Analysis, we also show the complementarity between minimal generators and closed itemsets. Then, we focus on the key role played by these patterns for solving several problem associated to various pattern classes. In this respect, we classify concise representations of frequent itemsets according to their common characteristics. Then, we analyze a representative of each class and show its close link with minimal generators. Finally, we carry out a critical study of concise representations with respect to several aspects and comparative criteria which proves the importance of considering closed sets and minimal generators.