Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast sequential and parallel algorithms for association rule mining: a comparison
Fast sequential and parallel algorithms for association rule mining: a comparison
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
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Data Mining: An Overview from a Database Perspective
IEEE Transactions on Knowledge and Data Engineering
Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
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
FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies
ICDT '01 Proceedings of the 8th 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
The Closed Keys Base of Frequent Itemsets
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
CL '00 Proceedings of the First International Conference on Computational Logic
Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Constructing Approximate Informative Basis of Association Rules
DS '01 Proceedings of the 4th International Conference on Discovery Science
Datascape Survey Using the Cascade Model
DS '02 Proceedings of the 5th International Conference on Discovery Science
Discovery of Core Episodes from Sequences
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
Relational Association Rules: Getting WARMeR
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
Efficient Data Mining Based on Formal Concept Analysis
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Real World Association Rule Mining
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
BIDE: Efficient Mining of Frequent Closed Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Essential classification rule sets
ACM Transactions on Database Systems (TODS)
Summarization — Compressing Data into an Informative Representation
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Discovering Frequent Arrangements of Temporal Intervals
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Blocking Anonymity Threats Raised by Frequent Itemset Mining
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
CloseMiner: Discovering Frequent Closed Itemsets Using Frequent Closed Tidsets
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
On Characterization and Discovery of Minimal Unexpected Patterns in Rule Discovery
IEEE Transactions on Knowledge and Data Engineering
Fast accumulation lattice algorithm for mining sequential patterns
ACOS'07 Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6
Fast mining maximal sequential patterns
SMO'07 Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization
A Unified View of Objective Interestingness Measures
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
DELAY: A Lazy Approach for Mining Frequent Patterns over High Speed Data Streams
ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
Discovering Knowledge from Local Patterns with Global Constraints
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Mining Supplemental Frequent Patterns
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Negative Generator Border for Effective Pattern Maintenance
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Moment+: Mining Closed Frequent Itemsets over Data Stream
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Decomposable Families of Itemsets
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
RETRACTED: Efficient mining of temporal emerging itemsets from data streams
Expert Systems with Applications: An International Journal
Constructing Iceberg Lattices from Frequent Closures Using Generators
DS '08 Proceedings of the 11th International Conference on Discovery Science
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
Mining Non-redundant Reclassification Rules
IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
Mining Multiple Level Non-redundant Association Rules through Two-Fold Pruning of Redundancies
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Efficient Vertical Mining of Frequent Closures and Generators
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
CloseViz: visualizing useful patterns
Proceedings of the ACM SIGKDD Workshop on Useful Patterns
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
Negative correlations in collaboration: concepts and algorithms
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximate algorithms with generalizing attribute values for k-anonymity
Information Systems
Transactions on rough sets XII
Yet another algorithms for selecting bitmap join indexes
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Mining non-redundant information-theoretic dependencies between itemsets
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Summarising data by clustering items
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Mining monolingual and bilingual corpora
Intelligent Data Analysis
Proceedings of the VLDB Endowment
On enumerating frequent closed patterns with key in multi-relational data
DS'10 Proceedings of the 13th international conference on Discovery science
ESTATE: strategy for exploring labeled spatial datasets using association analysis
DS'10 Proceedings of the 13th international conference on Discovery science
Mining minimal non-redundant association rules using frequent itemsets lattice
International Journal of Intelligent Systems Technologies and Applications
Diagnostic tests based on knowledge states
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part III
Galois sub-hierarchy and orderings
AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Efficient link-based clustering in a large scaled blog network
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Krimp: mining itemsets that compress
Data Mining and Knowledge Discovery
Valuations and closure operators on finite lattices
Discrete Applied Mathematics
An approach for adaptive associative classification
Expert Systems with Applications: An International Journal
Reliable representations for association rules
Data & Knowledge Engineering
A novel evolutionary method to search interesting association rules by keywords
Expert Systems with Applications: An International Journal
Itemset mining: A constraint programming perspective
Artificial Intelligence
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Tell me what i need to know: succinctly summarizing data with itemsets
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Partial orders and logical concept analysis to explore patterns extracted by data mining
ICCS'11 Proceedings of the 19th international conference on Conceptual structures for discovering knowledge
Mining approximate frequent closed flows over packet streams
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Non-redundant subgroup discovery in large and complex data
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Summarizing frequent itemsets via pignistic transformation
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Controlling false positives in association rule mining
Proceedings of the VLDB Endowment
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
Condensed representation of EPs and patterns quantified by frequency-based measures
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
TP+close: mining frequent closed patterns in gene expression datasets
VDMB'06 Proceedings of the First international conference on Data Mining and Bioinformatics
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Summarizing frequent patterns using profiles
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Mining frequent closed itemsets without candidate generation
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
A correspondence between maximal complete bipartite subgraphs and closed patterns
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Improving data quality by source analysis
Journal of Data and Information Quality (JDIQ)
Parallel discovery of network motifs
Journal of Parallel and Distributed Computing
Optimized rule mining through a unified framework for interestingness measures
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Efficient mining of large maximal bicliques
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
About the enumeration algorithms of closed sets
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Automatic selection of bitmap join indexes in data warehouses
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
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
Optimizing a sequence of frequent pattern queries
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
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
Incremental classification rules based on association rules using formal concept analysis
MLDM'05 Proceedings of the 4th international conference on Machine Learning and Data Mining in Pattern Recognition
Relevance of counting in data mining tasks
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
Finding all frequent patterns starting from the closure
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
Efficient mining of cross-transaction web usage patterns in large database
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
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
Finding closed itemsets in data streams
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
A relational query primitive for constraint-based pattern mining
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets
Expert Systems with Applications: An International Journal
Mining succinct systems of minimal generators of formal concepts
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
An output-polynomial time algorithm for mining frequent closed attribute trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Mining frequent δ-free patterns in large databases
DS'05 Proceedings of the 8th international conference on Discovery Science
Lossless reduction of datacubes
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Why and how knowledge discovery can be useful for solving problems with CBR
ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
Towards generic pattern mining
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
On computing the minimal generator family for concept lattices and icebergs
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Data mining in inductive databases
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Transaction databases, frequent itemsets, and their condensed representations
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
TripRec: recommending trip routes from large scale check-in data
Proceedings of the 21st international conference companion on World Wide Web
A false negative maximal frequent itemset mining algorithm over stream
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part I
Data Mining and Knowledge Discovery
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets
Journal of the ACM (JACM)
Efficient colossal pattern mining in high dimensional datasets
Knowledge-Based Systems
Proceedings of the 6th Euro American Conference on Telematics and Information Systems
Finding minimum representative pattern sets
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Harnessing the wisdom of the crowds for accurate web page clipping
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Cover similarity based item set mining
Bisociative Knowledge Discovery
Computers & Mathematics with Applications
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Summarizing data succinctly with the most informative itemsets
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
Selection and pruning algorithms for bitmap index selection problem using data mining
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Pruning search space of physical database design
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Incorporating occupancy into frequent pattern mining for high quality pattern recommendation
Proceedings of the 21st ACM international conference on Information and knowledge management
Parallel frequent itemset mining using systolic arrays
Knowledge-Based Systems
Static and incremental selection of multi-table indexes for very large join queries
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Mining frequent itemsets in large databases: The hierarchical partitioning approach
Expert Systems with Applications: An International Journal
Summarizing categorical data by clustering attributes
Data Mining and Knowledge Discovery
A survey on enhanced subspace clustering
Data Mining and Knowledge Discovery
Two scalable algorithms for associative text classification
Information Processing and Management: an International Journal
Research on Key Technology in Remote Education System of Spirit Diagnosing by Eye in TCM
International Journal of Distance Education Technologies
Constrained Cube Lattices for Multidimensional Database Mining
International Journal of Data Warehousing and Mining
A lattice-based approach for mining most generalization association rules
Knowledge-Based Systems
Mining multidimensional contextual outliers from categorical relational data
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Summarizing probabilistic frequent patterns: a fast approach
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Randomly sampling maximal itemsets
Proceedings of the ACM SIGKDD Workshop on Interactive Data Exploration and Analytics
A performance study of three disk-based structures for indexing and querying frequent itemsets
Proceedings of the VLDB Endowment
MiningZinc: a modeling language for constraint-based mining
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
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)
Misleading Generalized Itemset discovery
Expert Systems with Applications: An International Journal
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
G-Tries: a data structure for storing and finding subgraphs
Data Mining and Knowledge Discovery
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
Intelligent Decision Technologies
| Hi-index | 0.01 |
In this paper, we address the problem of finding frequent itemsets in a database. Using the closed itemset lattice framework, we show that this problem can be reduced to the problem of finding frequent closed itemsets. Based on this statement, we can construct efficient data mining algorithms by limiting the search space to the closed itemset lattice rather than the subset lattice. Moreover, we show that the set of all frequent closed itemsets suffices to determine a reduced set of association rules, thus addressing another important data mining problem: limiting the number of rules produced without information loss. We propose a new algorithm, called A-Close, using a closure mechanism to find frequent closed itemsets. We realized experiments to compare our approach to the commonly used frequent itemset search approach. Those experiments showed that our approach is very valuable for dense and/or correlated data that represent an important part of existing databases.