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
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 generalized association rules
Future Generation Computer Systems - Special double issue on data mining
Mining the most interesting rules
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
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
Depth first generation of long patterns
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
A tree projection algorithm for generation of frequent item sets
Journal of Parallel and Distributed Computing - Special issue on high-performance data mining
KDD-Cup 2000 organizers' report: peeling the onion
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
DEMON: Mining and Monitoring Evolving Data
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
Mining Association Rules: Anti-Skew Algorithms
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Mining Optimized Association Rules with Categorical and Numeric Attributes
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Online Generation of Association Rules
ICDE '98 Proceedings of the Fourteenth International Conference on 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
Efficiently Mining Maximal Frequent Itemsets
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Mining Frequent Itemsets Using Support Constraints
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
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
Data Organization and Access for Efficient Data Mining
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Data mining approaches for intrusion detection
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
OPUS: an efficient admissible algorithm for unordered search
Journal of Artificial Intelligence Research
Mining itemset utilities from transaction databases
Data & Knowledge Engineering - Special issue: ER 2003
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
Frequent pattern mining for kernel trace data
Proceedings of the 2008 ACM symposium on Applied computing
Constraint programming for itemset mining
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Analysis of Alarm Sequences in a Chemical Plant
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
A framework for mining top-k frequent closed itemsets using order preserving generators
Proceedings of the 2nd Bangalore Annual Compute Conference
Frequent pattern mining with uncertain data
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Cartesian contour: a concise representation for a collection of frequent sets
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Solving a committee formation and scheduling problem by frequent itemset mining
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Constructing and exploring composite items
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Block interaction: a generative summarization scheme for frequent patterns
Proceedings of the ACM SIGKDD Workshop on Useful Patterns
Mining uncertain data with probabilistic guarantees
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Identifying cross-cutting concerns using software repository mining
Proceedings of the Joint ERCIM Workshop on Software Evolution (EVOL) and International Workshop on Principles of Software Evolution (IWPSE)
Integrating constraint programming and itemset mining
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Intelligent Data Analysis
An efficient algorithm for mining erasable itemsets
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Summarizing transactional databases with overlapped hyperrectangles
Data Mining and Knowledge Discovery
Itemset mining as a challenge application for answer set enumeration
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Mining maximal co-located event sets
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast mining erasable itemsets using NC_sets
Expert Systems with Applications: An International Journal
Transactional Database Transformation and Its Application in Prioritizing Human Disease Genes
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
An efficient mining algorithm for maximal weighted frequent patterns in transactional databases
Knowledge-Based Systems
Aggregate licenses validation for digital rights violation detection
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Issue on Multimedia Security
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
Weak Ratio Rules: A Generalized Boolean Association Rules
International Journal of Data Warehousing and Mining
Computation time efficient approach for licenses validation in DRM systems
Multimedia Tools and Applications
Mining co-locations under uncertainty
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Novel parallel method for mining frequent patterns on multi-core shared memory systems
DISCS-2013 Proceedings of the 2013 International Workshop on Data-Intensive Scalable Computing Systems
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
Efficient frequent pattern mining based on Linear Prefix tree
Knowledge-Based Systems
An efficient construction and application usefulness of rectangle greedy covers
Pattern Recognition
Interesting pattern mining in multi-relational data
Data Mining and Knowledge Discovery
Efficient mining of maximal correlated weight frequent patterns
Intelligent Data Analysis
| Hi-index | 0.00 |
We present a new algorithm for mining maximal frequent itemsets from a transactional database. The search strategy of the algorithm integrates a depth-first traversal of the itemset lattice with effective pruning mechanisms that significantly improve mining performance. Our implementation for support counting combines a vertical bitmap representation of the data with an efficient bitmap compression scheme. In a thorough experimental analysis, we isolate the effects of individual components of MAFIA including search space pruning techniques and adaptive compression. We also compare our performance with previous work by running tests on very different types of data sets. Our experiments show that MAFIA performs best when mining long itemsets and outperforms other algorithms on dense data by a factor of three to 30.