Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A database perspective on knowledge discovery
Communications of the ACM
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 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
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Generating non-redundant association rules
Proceedings of the sixth 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”
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Data Mining and Knowledge Discovery
Concise Representation of Frequent Patterns Based on Disjunction-Free Generators
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Approximation of Frequency Queris by Means of Free-Sets
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
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
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th 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 Free Itemsets under Constraints
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Frequent Closures as a Concise Representation for Binary Data Mining
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
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
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
CL '00 Proceedings of the First International Conference on Computational Logic
A perspective on inductive databases
ACM SIGKDD Explorations Newsletter
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Theory of Inductive Query Answering
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
DBC: a condensed representation of frequent patterns for efficient mining
Information Systems
BIDE: Efficient Mining of Frequent Closed Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
LCGMiner: Levelwise Closed Graph Pattern Mining from Large Databases
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
On Closed Constrained Frequent Pattern Mining
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Constraint-based concept mining and its application to microarray data analysis
Intelligent Data Analysis
Frequent closed itemset based algorithms: a thorough structural and analytical survey
ACM SIGKDD Explorations Newsletter
Expressive power of an algebra for data mining
ACM Transactions on Database Systems (TODS)
Itemset frequency satisfiability: Complexity and axiomatization
Theoretical Computer Science
Adequate condensed representations of patterns
Data Mining and Knowledge Discovery
Mining conjunctive sequential patterns
Data Mining and Knowledge Discovery
Discovering Knowledge from Local Patterns with Global Constraints
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Constructing Iceberg Lattices from Frequent Closures Using Generators
DS '08 Proceedings of the 11th International Conference on Discovery Science
Post-processing of associative classification rules using closed sets
Expert Systems with Applications: An International Journal
Data & Knowledge Engineering
A new generic basis of "factual" and "implicative" association rules
Intelligent Data Analysis
Condensed Representation of Sequential Patterns According to Frequency-Based Measures
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Non-redundant Subgroup Discovery Using a Closure System
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Mining multidimensional and multilevel sequential patterns
ACM Transactions on Knowledge Discovery from Data (TKDD)
A fast outlier detection strategy for distributed high-dimensional data sets with mixed attributes
Data Mining and Knowledge Discovery
About the lossless reduction of the minimal generator family of a context
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Towards a general framework for data mining
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
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
Actionability and formal concepts: a data mining perspective
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Succinct system of minimal generators: a thorough study, limitations and new definitions
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Margin-closed frequent sequential pattern mining
Proceedings of the ACM SIGKDD Workshop on Useful Patterns
Block interaction: a generative summarization scheme for frequent patterns
Proceedings of the ACM SIGKDD Workshop on Useful Patterns
Frequent regular itemset mining
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
A fast pruning redundant rule method using Galois connection
Applied Soft Computing
Two measures of objective novelty in association rule mining
PAKDD'09 Proceedings of the 13th Pacific-Asia international conference on Knowledge discovery and data mining: new frontiers in applied data mining
Finding minimal rare itemsets and rare association rules
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
Constraint programming for mining n-ary patterns
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Reliable representations for association rules
Data & Knowledge Engineering
Inductive databases and constraint-based data mining
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
Journal of Intelligent Information Systems
Itemset support queries using frequent itemsets and their condensed representations
DS'06 Proceedings of the 9th international conference on Discovery Science
Combining CSP and constraint-based mining for pattern discovery
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
A constraint language for declarative pattern discovery
Proceedings of the 27th Annual ACM Symposium on Applied Computing
An enhanced relevance criterion for more concise supervised pattern discovery
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Information Sciences: an International Journal
Tractable reasoning problems with fully-characterized association rules
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Closed and noise-tolerant patterns in n-ary relations
Data Mining and Knowledge Discovery
Weighted path as a condensed pattern in a single attributed DAG
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
ACM Transactions on Knowledge Discovery from Data (TKDD)
20 years of pattern mining: a bibliometric survey
ACM SIGKDD Explorations Newsletter
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
Hi-index | 0.00 |
Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific problem of frequent set mining from potentially huge boolean matrices has given rise to tens of efficient solvers. Frequent sets are indeed useful for many data mining tasks, including the popular association rule mining task but also feature construction, association-based classification, clustering, etc. The research in this area has been boosted by the fascinating concept of condensed representations w.r.t. frequency queries. Such representations can be used to support the discovery of every frequent set and its support without looking back at the data. Interestingly, the size of condensed representations can be several orders of magnitude smaller than the size of frequent set collections. Most of the proposals concern exact representations while it is also possible to consider approximated ones, i.e., to trade computational complexity with a bounded approximation on the computed support values. This paper surveys the core concepts used in the recent works on condensed representation for frequent sets.