An effective hash-based algorithm for mining association rules
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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
A fast algorithm for building lattices
Information Processing Letters
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Turbo-charging vertical mining of large databases
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
Depth first generation of long patterns
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Data mining: concepts and techniques
Data mining: concepts and techniques
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
Scalable Algorithms for Association Mining
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
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
Proceedings of the 17th International Conference on Data Engineering
Efficiently Mining Maximal Frequent Itemsets
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Data Organization and Access for Efficient Data Mining
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
CLOSET+: searching for the best strategies for mining frequent closed itemsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast vertical mining using diffsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Reasoning about sets using redescription mining
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Algorithms for time series knowledge mining
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
BLOSOM: a framework for mining arbitrary boolean expressions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining spatial association rules in image databases
Information Sciences: an International Journal
Efficient mining of understandable patterns from multivariate interval time series
Data Mining and Knowledge Discovery
Unsupervised pattern mining from symbolic temporal data
ACM SIGKDD Explorations Newsletter - Special issue on data mining for health informatics
A Galois Lattice framework to handle updates in the mining of closed itemsets in dynamic databases
COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
Discovering frequent itemsets by support approximation and itemset clustering
Data & Knowledge Engineering
An efficient algorithm for mining temporal high utility itemsets from data streams
Journal of Systems and Software
An efficient algorithm for mining closed inter-transaction itemsets
Data & Knowledge Engineering
A Linear Delay Algorithm for Building Concept Lattices
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Comparing Datasets Using Frequent Itemsets: Dependency on the Mining Parameters
SETN '08 Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications
An integrated, generic approach to pattern mining: data mining template library
Data Mining and Knowledge Discovery
Detecting significant distinguishing sets among bi-clusters
Proceedings of the 17th ACM conference on Information and knowledge management
Constructing Iceberg Lattices from Frequent Closures Using Generators
DS '08 Proceedings of the 11th International Conference on Discovery Science
Mining inter-sequence patterns
Expert Systems with Applications: An International Journal
Mining Regular Patterns in Transactional Databases
IEICE - Transactions on Information and Systems
Discovering Periodic-Frequent Patterns in Transactional Databases
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Representing lattices using many-valued relations
Information Sciences: an International Journal
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
Two FCA-Based Methods for Mining Gene Expression Data
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
A Novel Classification Algorithm Based on Association Rules Mining
Knowledge Acquisition: Approaches, Algorithms and Applications
Pattern Mining in Discrete Time Series and Application to Music Mining
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Mining closed patterns in multi-sequence time-series databases
Data & Knowledge Engineering
Mining Determining Sets for Partially Defined Functions
ICDM '09 Proceedings of the 9th Industrial Conference on Advances in Data Mining. Applications and Theoretical Aspects
Sliding window-based frequent pattern mining over data streams
Information Sciences: an International Journal
A Condensed Representation of Itemsets for Analyzing Their Evolution over Time
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
A concept lattice based outlier mining method in low-dimensional subspaces
Pattern Recognition Letters
Reduced representations of Emerging Cubes for OLAP database mining
International Journal of Business Intelligence and Data Mining
Mining closed flexible patterns in time-series databases
Expert Systems with Applications: An International Journal
Parallel Method for Mining High Utility Itemsets from Vertically Partitioned Distributed Databases
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Mining frequent closed patterns in pointset databases
Information Systems
An efficient algorithm for mining frequent maximal and closed itemsets
International Journal of Hybrid Intelligent Systems
Subrule analysis and the frequency-confidence diagram
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
ABBA: adaptive bicluster-based approach to impute missing values in binary matrices
Proceedings of the 2010 ACM Symposium on Applied Computing
Using a reinforced concept lattice to incrementally mine association rules from closed itemsets
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
A cost-efficient and versatile sanitizing algorithm by using a greedy approach
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Frequent regular itemset mining
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining minimal non-redundant association rules using frequent itemsets lattice
International Journal of Intelligent Systems Technologies and Applications
Generalized association rule mining using an efficient data structure
Expert Systems with Applications: An International Journal
Mining gene expression data with pattern structures in formal concept analysis
Information Sciences: an International Journal
An efficient strategy for mining high utility itemsets
International Journal of Intelligent Information and Database Systems
Interestingness measures for association rules: Combination between lattice and hash tables
Expert Systems with Applications: An International Journal
Mining frequent itemsets from multidimensional databases
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
Border algorithms for computing hasse diagrams of arbitrary lattices
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Biclustering numerical data in formal concept analysis
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
A simple statistical model and association rule filtering for classification
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Fuzzy Optimization and Decision Making
Mining regular patterns in data streams
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
About the enumeration algorithms of closed sets
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Role engineering: from theory to practice
Proceedings of the second ACM conference on Data and Application Security and Privacy
Efficient mining of association rules based on formal concept analysis
Formal Concept Analysis
Finding itemset-sharing patterns in a large itemset-associated graph
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets
Expert Systems with Applications: An International Journal
The parameterized complexity of enumerating frequent itemsets
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
PAISI'10 Proceedings of the 2010 Pacific Asia conference on Intelligence and Security Informatics
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
A practical approximation algorithm for optimal k-anonymity
Data Mining and Knowledge Discovery
Structures of association rule set
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
Efficient mining regularly frequent patterns in transactional databases
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Sampling minimal frequent boolean (DNF) patterns
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
An adaptive approach to mining frequent itemsets efficiently
Expert Systems with Applications: An International Journal
Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing
Fundamenta Informaticae
Several remarks on mining frequent trajectories in graphs
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
A completeness analysis of frequent weighted concept lattices and their algebraic properties
Data & Knowledge Engineering
Pervasive and Mobile Computing
A new method for mining Frequent Weighted Itemsets based on WIT-trees
Expert Systems with Applications: An International Journal
Mining frequent itemsets with dualistic constraints
PRICAI'12 Proceedings of the 12th Pacific Rim international conference on Trends in Artificial Intelligence
Mining frequent itemsets in large databases: The hierarchical partitioning approach
Expert Systems with Applications: An International Journal
A tree-based approach for mining frequent weighted utility itemsets
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
Interrelation analysis of celestial spectra data using constrained frequent pattern trees
Knowledge-Based Systems
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
Closed inter-sequence pattern mining
Journal of Systems and Software
A conceptual approach to gene expression analysis enhanced by visual analytics
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Formal and computational properties of the confidence boost of association rules
ACM Transactions on Knowledge Discovery from Data (TKDD)
Fast mining Top-Rank-k frequent patterns by using Node-lists
Expert Systems with Applications: An International Journal
An efficient method for mining frequent itemsets with double constraints
Engineering Applications of Artificial Intelligence
MEI: An efficient algorithm for mining erasable itemsets
Engineering Applications of Artificial Intelligence
Incrementally building frequent closed itemset lattice
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Interesting pattern mining in multi-relational data
Data Mining and Knowledge Discovery
Discovering diverse-frequent patterns in transactional databases
Proceedings of the 17th International Conference on Management of Data
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
| Hi-index | 0.02 |
The set of frequent closed itemsets uniquely determines the exact frequency of all itemsets, yet it can be orders of magnitude smaller than the set of all frequent itemsets. In this paper, we present CHARM, an efficient algorithm for mining all frequent closed itemsets. It enumerates closed sets using a dual itemset-tidset search tree, using an efficient hybrid search that skips many levels. It also uses a technique called diffsets to reduce the memory footprint of intermediate computations. Finally, it uses a fast hash-based approach to remove any "nonclosed驴 sets found during computation. We also present CHARM-L, an algorithm that outputs the closed itemset lattice, which is very useful for rule generation and visualization. An extensive experimental evaluation on a number of real and synthetic databases shows that CHARM is a state-of-the-art algorithm that outperforms previous methods. Further, CHARM-L explicitly generates the frequent closed itemset lattice.