The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
MAFIA: a maximal frequent itemset algorithm for transactional databases
Abstract
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very long. The search strategy of our algorithm integrates a depth-first traversal of the itemset lattice with effective pruning mechanisms. Our implementation of the search strategy combines a vertical bitmap representation of the database with an efficient relative bitmap compression schema. In a thorough experimental analysis of our algorithm on real data, we isolate the effect of the individual components of the algorithm. Our performance numbers show that our algorithm outperforms previous work by a factor of three to five.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · ACM SIGMOD Record · doi:10.1145/170036.170072 · Cited by 4,551
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
Dynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
Scalable algorithms for association mining
Zaki, M. J. (2000) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.846291 · Cited by 1,751
Mining generalized association rules
Srikant, R., & Agrawal, R. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00019-8 · Cited by 1,618
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223813 · Cited by 1,406
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Frequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
Sequential PAttern mining using a bitmap representation
Ayres, J., Flannick, J., Gehrke, J., & Yiu, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775109 · Cited by 1,082
Self-citationCHARM: An Efficient Algorithm for Closed Itemset Mining
Zaki, M. J., & Hsiao, C.-J. (2002) · Proceedings of the 2002 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.27 · Cited by 929
Tsai, C.-W., Lai, C.-F., Chao, H.-C., & Vasilakos, A. V. (2015) · Journal of Big Data · doi:10.1186/s40537-015-0030-3 · Cited by 818
Efficient algorithms for mining closed itemsets and their lattice structure
Zaki, M. J., & Hsiao, C.-J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.60 · Cited by 681
CloseGraph: mining closed frequent graph patterns
Yan, X., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956784 · Cited by 635
Fast vertical mining using diffsets
Zaki, M. J., & Gouda, K. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956788 · Cited by 593
CLOSET+: searching for the best strategies for mining frequent closed itemsets
Wang, J., Han, J., & Pei, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956779 · Cited by 585
Fast algorithms for frequent itemset mining using FP-trees
Grahne, G., & Zhu, J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.166 · Cited by 549
Efficiently mining maximal frequent itemsets
Gouda, K., & Zaki, M. J. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989514 · Cited by 397
Ceglar, A., & Roddick, J. F. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132958 · Cited by 324
Borgelt, C. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1074 · Cited by 291
MAFIA: a maximal frequent itemset algorithm
Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., & Yiu, T. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.183 · Cited by 267
Self-citationPrivacy-preserving trajectory data publishing by local suppression
Chen, R., Fung, B. C. M., Mohammed, N., Desai, B. C., & Wang, K. (2013) · Information Sciences · doi:10.1016/j.ins.2011.07.035 · Cited by 252
Constrained frequent pattern mining: a pattern-growth view
Pei, J., & Han, J. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568580 · Cited by 133
Metadata
- Authors
- Burdick, D., Calimlim, M., & Gehrke, J.
- Venue
- Proceedings 17th International Conference on Data Engineering
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-13
- Pages
- 443-452
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2108560469
- Cited by
- 612
- References
- 28
- FWCI
- 31.13
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.