MAFIA: a maximal frequent itemset algorithm
Doug Burdick, Manuel Calimlim, Jason A. Flannick et al. · IEEE Transactions on Knowledge and Data Engineering · 2005
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.
Cited by 267 works. doi:10.1109/tkde.2005.183
Authors
References
- Mining association rules between sets of items in large databases
- UCI Repository of machine learning databases
- Fast Algorithms for Mining Association Rules in Large Databases
- Fast algorithms for mining association rules
- Fast discovery of association rules
- Mining frequent patterns without candidate generation
- An effective hash-based algorithm for mining association rules
- Mining generalized association rules
- An Efficient Algorithm for Mining Association Rules in Large Databases
- Mining frequent patterns without candidate generation