Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
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
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
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
Real world performance of association rule algorithms
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable Parallel Data Mining for Association Rules
IEEE Transactions on Knowledge and Data Engineering
Discovering All Most Specific Sentences by Randomized Algorithms
ICDT '97 Proceedings of the 6th International Conference on Database Theory
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
Proceedings of the 17th International Conference on Data Engineering
H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
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 frequent item sets by opportunistic projection
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Top.K Frequent Closed Patterns without Minimum Support
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
On computing, storing and querying frequent 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
BIDE: Efficient Mining of Frequent Closed Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
FARMER: finding interesting rule groups in microarray datasets
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Advances in frequent itemset mining implementations: report on FIMI'03
ACM SIGKDD Explorations Newsletter - Special issue on learning from imbalanced datasets
Efficient closed pattern mining in the presence of tough block constraints
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
The complexity of mining maximal frequent itemsets and maximal frequent patterns
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
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
TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets
IEEE Transactions on Knowledge and Data Engineering
Scrutinizing Frequent Pattern Discovery Performance
ICDE '05 Proceedings of the 21st International Conference on 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
Mining top-K covering rule groups for gene expression data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Mining closed relational graphs with connectivity constraints
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Reasoning about sets using redescription mining
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Pattern lattice traversal by selective jumps
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Mining compressed frequent-pattern sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Fast Algorithms for Frequent Itemset Mining Using FP-Trees
IEEE Transactions on Knowledge and Data Engineering
Fast and Memory Efficient Mining of Frequent Closed Itemsets
IEEE Transactions on Knowledge and Data Engineering
Discovering Frequent Arrangements of Temporal Intervals
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Closed Constrained Gradient Mining in Retail Databases
IEEE Transactions on Knowledge and Data Engineering
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
CFI-Stream: mining closed frequent itemsets in data streams
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
LinkClus: efficient clustering via heterogeneous semantic links
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Mining frequent closed cubes in 3D datasets
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Discovering Frequent Closed Partial Orders from Strings
IEEE Transactions on Knowledge and Data Engineering
Mining compressed commodity workflows from massive RFID data sets
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Describing differences between databases
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Mining Generalized Associations of Semantic Relations from Textual Web Content
IEEE Transactions on Knowledge and Data Engineering
Computational aspects of mining maximal frequent patterns
Theoretical Computer Science
Mining lossless closed frequent patterns with weight constraints
Knowledge-Based Systems
Mining association rules in very large clustered domains
Information Systems
Structural geography of the space of emerging patterns
Intelligent Data Analysis
Efficient mining of weighted interesting patterns with a strong weight and/or support affinity
Information Sciences: an International Journal
Frequent Closed Sequence Mining without Candidate Maintenance
IEEE Transactions on Knowledge and Data Engineering
Mining statistically important equivalence classes and delta-discriminative emerging patterns
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining complex power networks for blackout prevention
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
IEEE Transactions on Knowledge and Data Engineering
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
A framework for incremental generation of closed itemsets
Discrete Applied Mathematics
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
An efficient algorithm for mining frequent closed itemsets in dynamic transaction databases
International Journal of Intelligent Systems Technologies and Applications
An efficient algorithm for mining closed inter-transaction itemsets
Data & Knowledge Engineering
AusDM '07 Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70
Anonymity preserving pattern discovery
The VLDB Journal — The International Journal on Very Large Data Bases
A data mining proxy approach for efficient frequent itemset mining
The VLDB Journal — The International Journal on Very Large Data Bases
A survey on algorithms for mining frequent itemsets over data streams
Knowledge and Information Systems
Moment+: Mining Closed Frequent Itemsets over Data Stream
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
ISNN '08 Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II
An integrated, generic approach to pattern mining: data mining template library
Data Mining and Knowledge Discovery
A new concise representation of frequent itemsets using generators and a positive border
Knowledge and Information Systems
An efficient mining of weighted frequent patterns with length decreasing support constraints
Knowledge-Based Systems
Fast mining of closed sequential patterns
WSEAS Transactions on Computers
A novel Boolean algebraic framework for association and pattern mining
WSEAS Transactions on Computers
Maintaining frequent closed itemsets over a sliding window
Journal of Intelligent Information Systems
Implicit Groups of Web Pages as Constrained Top N Concepts
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Efficient mining of interesting weighted patterns from directed graph traversals
Integrated Computer-Aided Engineering
Closed patterns meet n-ary relations
ACM Transactions on Knowledge Discovery from Data (TKDD)
Post-processing of associative classification rules using closed sets
Expert Systems with Applications: An International Journal
Efficient discovery of risk patterns in medical data
Artificial Intelligence in Medicine
A Boolean algebraic framework for association and pattern mining
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
A framework for mining top-k frequent closed itemsets using order preserving generators
Proceedings of the 2nd Bangalore Annual Compute Conference
Finding Frequent Closed Itemsets in Sliding Window in Linear Time
IEICE - Transactions on Information and Systems
A proximate dynamics model for data mining
Expert Systems with Applications: An International Journal
A new multimedia information data mining method
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
On pushing weight constraints deeply into frequent itemset mining
Intelligent Data 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
Minimum description length principle: generators are preferable to closed patterns
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Mining closed patterns in multi-sequence time-series databases
Data & Knowledge Engineering
Mining Frequent Patterns from Network Data Flow
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Efficient itemset generator discovery over a stream sliding window
Proceedings of the 18th ACM conference on Information and knowledge management
Mining closed flexible patterns in time-series databases
Expert Systems with Applications: An International Journal
Mining frequent closed patterns in pointset databases
Information Systems
Frequent closed multi-dimensional multi-level pattern mining
ACST '08 Proceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technology
A persistent HY-Tree to efficiently support itemset mining on large datasets
Proceedings of the 2010 ACM Symposium on Applied Computing
GC-tree: a fast online algorithm for mining frequent closed itemsets
PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
CLAIM: an efficient method for relaxed frequent closed itemsets mining over stream data
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Discovery of frequent distributed event patterns in sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
TGC-tree: an online algorithm tracing closed itemset and transaction set simultaneously
LKR'08 Proceedings of the 3rd international conference on Large-scale knowledge resources: construction and application
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
A flexible and efficient sequential pattern mining algorithm
International Journal of Intelligent Information and Database Systems
Mining top-k frequent closed itemsets over data streams using the sliding window model
Expert Systems with Applications: An International Journal
Approximate weighted frequent pattern mining with/without noisy environments
Knowledge-Based Systems
Swarm: mining relaxed temporal moving object clusters
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
Mining minimal non-redundant association rules using frequent itemsets lattice
International Journal of Intelligent Systems Technologies and Applications
An efficient algorithm for mining erasable itemsets
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Mining closed discriminative dyadic sequential patterns
Proceedings of the 14th International Conference on Extending Database Technology
Efficient link-based clustering in a large scaled blog network
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Regression analysis of the number of association rules
International Journal of Automation and Computing
HUC-Prune: an efficient candidate pruning technique to mine high utility patterns
Applied Intelligence
Valuations and closure operators on finite lattices
Discrete Applied Mathematics
Interestingness measures for association rules: Combination between lattice and hash tables
Expert Systems with Applications: An International Journal
MoveMine: Mining moving object data for discovery of animal movement patterns
ACM Transactions on Intelligent Systems and Technology (TIST)
Transductive learning to rank using association rules
Expert Systems with Applications: An International Journal
Prediction of essential genes by mining gene ontology semantics
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
An efficient itemset mining approach for data streams
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
Mining direct antagonistic communities in explicit trust networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Compositional object pattern: a new model for album event recognition
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Fast mining erasable itemsets using NC_sets
Expert Systems with Applications: An International Journal
Mining formal concepts with a bounded number of exceptions from transactional data
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
An efficient user-oriented clustering of web search results
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
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
An efficient approach for interactive mining of frequent itemsets
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Efficient mining of large maximal bicliques
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
A fast algorithm for maintenance of association rules in incremental databases
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
About the enumeration algorithms of closed sets
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
An algorithm for extracting rare concepts with concise intents
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Efficient mining of association rules based on formal concept analysis
Formal Concept Analysis
Finding all frequent patterns starting from the closure
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
WLPMiner: weighted frequent pattern mining with length-decreasing support constraints
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
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
Single-pass incremental and interactive mining for weighted frequent patterns
Expert Systems with Applications: An International Journal
Mining closed episodes from event sequences efficiently
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Towards generic pattern mining
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Efficient colossal pattern mining in high dimensional datasets
Knowledge-Based Systems
Mining frequent association tag sequences for clustering XML documents
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Finding minimum representative pattern sets
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
A distributed recommender system architecture
International Journal of Web Engineering and Technology
Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing
Fundamenta Informaticae
CWFM: closed contingency weighted frequent itemsets mining
ICDM'12 Proceedings of the 12th Industrial conference on Advances in Data Mining: applications and theoretical aspects
Finding top-n colossal patterns based on clique search with dynamic update of graph
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
Recent frequent itemsets mining over data streams
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Parallel computation of closed itemsets and implication rule bases
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Parallel frequent itemset mining using systolic arrays
Knowledge-Based Systems
Mining frequent itemsets in large databases: The hierarchical partitioning approach
Expert Systems with Applications: An International Journal
Like-Minded communities: bringing the familiarity and similarity together
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
A sliding window based algorithm for frequent closed itemset mining over data streams
Journal of Systems and Software
Sequential pattern mining -- approaches and algorithms
ACM Computing Surveys (CSUR)
Research on Key Technology in Remote Education System of Spirit Diagnosing by Eye in TCM
International Journal of Distance Education Technologies
A lattice-based approach for mining most generalization association rules
Knowledge-Based Systems
The complexity of mining maximal frequent subgraphs
Proceedings of the 32nd symposium on Principles of database systems
Mining multidimensional contextual outliers from categorical relational data
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Mining direct antagonistic communities in signed social networks
Information Processing and Management: an International Journal
An efficient and scalable algorithm for mining maximal
MLDM'13 Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition
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
Efficient mining of maximal correlated weight frequent patterns
Intelligent Data Analysis
| Hi-index | 0.02 |
Mining frequent closed itemsets provides complete and non-redundant results for frequent pattern analysis. Extensive studies have proposed various strategies for efficient frequent closed itemset mining, such as depth-first search vs. breadthfirst search, vertical formats vs. horizontal formats, tree-structure vs. other data structures, top-down vs. bottom-up traversal, pseudo projection vs. physical projection of conditional database, etc. It is the right time to ask "what are the pros and cons of the strategies?" and "what and how can we pick and integrate the best strategies to achieve higher performance in general cases?"In this study, we answer the above questions by a systematic study of the search strategies and develop a winning algorithm CLOSET+. CLOSET+ integrates the advantages of the previously proposed effective strategies as well as some ones newly developed here. A thorough performance study on synthetic and real data sets has shown the advantages of the strategies and the improvement of CLOSET+ over existing mining algorithms, including CLOSET, CHARM and OP, in terms of runtime, memory usage and scalability.