The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
MAFIA: a maximal frequent itemset algorithm
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
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 frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
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
Discovering Frequent Closed Itemsets for Association Rules
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_25 · Cited by 1,378
Efficiently mining long patterns from databases
Bayardo, R. J. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276313 · Cited by 1,302
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
Sampling Large Databases for Association Rules
Toivonen, H. T. T. (1996) · Cited by 1,089
CLOSET : An Efficient Algorithm for Mining Frequent Closed Itemsets
Pei, J. (2000) · Cited by 824
Mining the most interesting rules
Bayardo, R. J., & Agrawal, R. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312219 · Cited by 653
MAFIA: a maximal frequent itemset algorithm for transactional databases
Burdick, D., Calimlim, M., & Gehrke, J. (2002) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914857 · Cited by 612
Self-citationCombinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm.
Rigoutsos, I., & Floratos, A. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.1.55 · Cited by 557
A Tree Projection Algorithm for Generation of Frequent Item Sets
Agarwal, R. C., Aggarwal, C. C., & Prasad, V. V. V. (2001) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.2000.1693 · Cited by 510
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · ACM SIGMOD Record · doi:10.1145/568271.223813 · Cited by 491
Efficiently mining long patterns from databases
Bayardo, R. J. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276313 · Cited by 398
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
Search through systematic set enumeration
Rymon, R. (1992) · Cited by 346
Depth first generation of long patterns
Agarwal, R. C., Aggarwal, C. C., & Prasad, V. V. V. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347114 · Cited by 325
Pincer-search: A new algorithm for discovering the maximum frequent set
Lin, D.-I., & Kedem, Z. M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0100980 · Cited by 277
Turbo-charging vertical mining of large databases
Shenoy, P., Haritsa, J. R., Sudarshan, S., Bhalotia, G., Bawa, M., & Shah, D. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335376 · Cited by 260
KDD-Cup 2000 organizers' report: peeling the onion
Kohavi, R., Brodley, C. E., Frasca, B., Mason, L., & Zheng, Z. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.381033 · Cited by 256
OPUS: An Efficient Admissible Algorithm for Unordered Search
Webb, G. I. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.227 · Cited by 207
Mining Frequent Itemsets Using Support Constraints
Wang, K., He, Y. H., & Han, J. (2000) · Cited by 133
Turbo-charging vertical mining of large databases
Shenoy, P., Haritsa, J. R., Sudarshan, S., Bhalotia, G., Bawa, M., & Shah, D. (2000) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/342009.335376 · Cited by 129
Online generation of association rules
Aggarwal, C. C., & Yu, P. S. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1998.655803 · Cited by 122
DEMON: mining and monitoring evolving data
Ganti, V., Gehrke, J. E., & Ramakrishnan, R. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.908980 · Cited by 115
Self-citationA Perspective on Databases and data mining
Holsheimer, M., Kersten, M. L., Mannila, H., & Toivonen, H. T. T. (1995) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 111
Discovering all most specific sentences by randomized algorithms extended abstract
Gunopulos, D., Mannila, H., & Saluja, S. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62222-5_47 · Cited by 31
Cited by
Frequent pattern mining with uncertain data
Aggarwal, C. C., Li, Y., Wang, J., & Wang, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557030 · Cited by 297
Business Intelligence for Enterprise Systems: A Survey
Duan, L., & Xu, L. D. (2012) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2188804 · Cited by 254
Metadata
- Authors
- Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., & Yiu, T.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2005-11
- Volume
- 17
- Issue
- 11
- Pages
- 1490-1504
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2159257592
- Cited by
- 267
- References
- 36
- FWCI
- 23.21
- Type
- journal article
- 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.