An algorithm for dynamic subset and intersection testing
Theoretical Computer Science
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
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
Depth first generation of long patterns
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
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
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
Fast vertical mining using diffsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Advances in frequent itemset mining implementations: report on FIMI'03
ACM SIGKDD Explorations Newsletter - Special issue on learning from imbalanced datasets
Summarizing itemset patterns using probabilistic models
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
BitTableFI: An efficient mining frequent itemsets algorithm
Knowledge-Based Systems
Maintenance of maximal frequent itemsets in large databases
Proceedings of the 2007 ACM symposium on Applied computing
A Contribution to the Use of Decision Diagrams for Loading and Mining Transaction Databases
Fundamenta Informaticae - Special issue ISMIS'05
A view selection algorithm with performance guarantee
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A framework for mining top-k frequent closed itemsets using order preserving generators
Proceedings of the 2nd Bangalore Annual Compute Conference
Deriving strong association mining rules using a dependency criterion, the lift measure
International Journal of Data Analysis Techniques and Strategies
Multi-documents Automatic Abstracting based on text clustering and semantic analysis
Knowledge-Based Systems
A Pattern Mining Approach Using QVT
ECMDA-FA '09 Proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications
An efficient algorithm for mining frequent maximal and closed itemsets
International Journal of Hybrid Intelligent Systems
Evolution and maintenance of frequent pattern space when transactions are removed
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Using a cosine-type measure to derive strong association mining rules
International Journal of Knowledge Engineering and Data Mining
Mining uncertain data with probabilistic guarantees
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithms for mining frequent itemsets in static and dynamic datasets
Intelligent Data Analysis
Automatic schema merging using mapping constraints among incomplete sources
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
COSINE: a vertical group difference approach to contrast set mining
Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
GENCCS: a correlated group difference approach to contrast set mining
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
A parallel algorithm for computing borders
Proceedings of the 20th ACM international conference on Information and knowledge management
Peak-Jumping frequent itemset mining algorithms
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
On the computation of maximal-correlated cuboids cells
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
A structure preserving flat data format representation for tree-structured data
PAKDD'11 Proceedings of the 15th international conference on New Frontiers in Applied Data Mining
Privacy preserving mining maximal frequent patterns in transactional databases
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Substructure clustering: a novel mining paradigm for arbitrary data types
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
A Contribution to the Use of Decision Diagrams for Loading and Mining Transaction Databases
Fundamenta Informaticae - Special issue ISMIS'05
Incorporating occupancy into frequent pattern mining for high quality pattern recommendation
Proceedings of the 21st ACM international conference on Information and knowledge management
Weak Ratio Rules: A Generalized Boolean Association Rules
International Journal of Data Warehousing and Mining
MFMS: maximal frequent module set mining from multiple human gene expression data sets
Proceedings of the 12th International Workshop on Data Mining in Bioinformatics
Anytime algorithms for mining groups with maximum coverage
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
Sliding window based weighted maximal frequent pattern mining over data streams
Expert Systems with Applications: An International Journal
Mining maximal frequent patterns by considering weight conditions over data streams
Knowledge-Based Systems
An efficient construction and application usefulness of rectangle greedy covers
Pattern Recognition
| Hi-index | 0.00 |
We present GenMax, a backtrack search based algorithm for mining maximal frequent itemsets. GenMax uses a number of optimizations to prune the search space. It uses a novel technique called progressive focusing to perform maximality checking, and diffset propagation to perform fast frequency computation. Systematic experimental comparison with previous work indicates that different methods have varying strengths and weaknesses based on dataset characteristics. We found GenMax to be a highly efficient method to mine the exact set of maximal patterns.