The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Frequent itemset mining: A 25 years review
Abstract
Frequent itemset mining (FIM) is an essential task within data analysis since it is responsible for extracting frequently occurring events, patterns, or items in data. Insights from such pattern analysis offer important benefits in decision‐making processes. However, algorithmic solutions for mining such kind of patterns are not straightforward since the computational complexity exponentially increases with the number of items in data. This issue, together with the significant memory consumption that is present in the mining process, makes it necessary to propose extremely efficient solutions. Since the FIM problem was first described in the early 1990s, multiple solutions have been proposed by considering centralized systems as well as parallel (shared or nonshared memory) architectures. Solutions can also be divided into exhaustive search and nonexhaustive search models. Many of such approaches are extensions of other solutions and it is therefore necessary to analyze how this task has been considered during the last decades. This article is categorized under: Algorithmic Development > Association Rules Technologies > Association Rules
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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
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 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
Data Mining: Concepts and Techniques
Thamaraiselvi, G., & Kaliammal, A. (2014) · Journal of Information and Knowledge · Cited by 4,088
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
Trajectory Data Mining: An Overview
Zheng, Y. (2015) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2743025 · Cited by 1,460
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
Dynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur⋆, S. (1997) · ACM SIGMOD Record · doi:10.1145/253262.253325 · Cited by 639
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
Knowledge Discovery from Data Streams
Gama, J. (2010) · Chapman & Hall/CRC eBooks · doi:10.1201/ebk1439826119 · Cited by 571
Selecting the right objective measure for association analysis
Tan, P.-N., Kumar, V., & Srivastava, J. (2004) · Information Systems · doi:10.1016/s0306-4379(03)00072-3 · Cited by 568
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
Pfp: parallel fp-growth for query recommendation
Li, H., Wang, Y., Zhang, D., Zhang, M., & Chang, E. Y. (2008) · Proceedings of the 2008 ACM conference on Recommender systems · doi:10.1145/1454008.1454027 · Cited by 444
A fast distributed algorithm for mining association rules
Cheung, D. W., Han, J., Ng, V. T., Fu, A. W., & Fu, Y. (2002) · Fourth International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568665 · Cited by 432
H-mine: hyper-structure mining of frequent patterns in large databases
Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., & Yang, D. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989550 · Cited by 408
EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT
Borgelt, C. (2003) · Cited by 394
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
Uno, T., Kiyomi, M., & Arimura, H. (2004) · Cited by 362
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46027-6 · Cited by 346
A survey of frequent subgraph mining algorithms
Jiang, C., Coenen, F., & Zito, M. (2013) · The Knowledge Engineering Review · doi:10.1017/s0269888912000331 · Cited by 346
(2014) · Springer eBooks · doi:10.1007/978-3-319-07821-2 · Cited by 320
Parallel Algorithms for Discovery of Association Rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Li, W. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009773317876 · Cited by 305
Borgelt, C. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1074 · Cited by 291
Mining for strong negative associations in a large database of customer transactions
Savasere, A., Omiecinski, E., & Navathe, S. (2002) · Proceedings 14th International Conference on Data Engineering · doi:10.1109/icde.1998.655812 · Cited by 268
Fournier‐Viger, P., Lin, J. C., Vo, B., Chi, T. T., Zhang, J., & Le, H. B. (2017) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1207 · Cited by 237
Self-citationApriori-based frequent itemset mining algorithms on MapReduce
Lin, M.-Y., Lee, P.-Y., & Hsueh, S.-C. (2012) · Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication · doi:10.1145/2184751.2184842 · Cited by 233
LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining
Uno, T., Kiyomi, M., & Arimura, H. (2005) · Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations · doi:10.1145/1133905.1133916 · Cited by 233
The (black) art of runtime evaluation: Are we comparing algorithms or implementations?
Kriegel, H.-P., Schubert, E., & Zimek, A. (2017) · Knowledge and Information Systems · doi:10.1007/s10115-016-1004-2 · Cited by 229
Expert-Guided Subgroup Discovery: Methodology and Application
Gamberger, D., & Lavrač, N. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1089 · Cited by 214
Frequent Itemset Mining for Big Data
Moens, S., Aksehirli, E., & Goethals, B. (2013) · 2013 IEEE International Conference on Big Data · doi:10.1109/bigdata.2013.6691742 · Cited by 213
Yan, X., Zhang, C., & Zhang, S. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.01.028 · Cited by 211
Finding frequent substructures in chemical compounds
Raedt, L. D., Toivonen, H. T. T., & King, R. D. (1998) · Lirias · Cited by 171
Data mining for discrimination discovery
Ruggieri, S., Pedreschi, D., & Turini, F. (2010) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1754428.1754432 · Cited by 166
A survey of incremental high‐utility itemset mining
Gan, W., Lin, J. C., Fournier‐Viger, P., Chao, H., Hong, T., & Fujita, H. (2018) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1242 · Cited by 156
Self-citationFast parallel association rule mining without candidacy generation
Zai͏̈ane, O. R., El-Hajj, M. I., & Lu, P. (2002) · Proceedings · doi:10.1109/icdm.2001.989600 · Cited by 152
Algorithms for frequent itemset mining: a literature review
Chee, C.-H., Jaafar, J., Aziz, I. A., Hasan, M. H., & Yeoh, W. (2018) · Artificial Intelligence Review · doi:10.1007/s10462-018-9629-z · Cited by 126
QuantMiner: A Genetic Algorithm for Mining Quantitative Association Rules
Salleb-Aouissi, A., Vrain, C., & Nortet, C. (2007) · Cited by 113
A Survey of High Utility Itemset Mining
Fournier‐Viger, P., Lin, J. C., Truong, T., & Nkambou, R. (2019) · Studies in big data · doi:10.1007/978-3-030-04921-8_1 · Cited by 113
Self-citationHigh-utility pattern mining: A method for discovery of high-utility item sets
Hu, J., & Mojsilović, A. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.02.003 · Cited by 102
Alataş, B., & Akın, E. (2005) · Soft Computing · doi:10.1007/s00500-005-0476-x · Cited by 101
Finding the Needle in the Big Data Systems Haystack
Kraska, T. (2013) · IEEE Internet Computing · doi:10.1109/mic.2013.10 · Cited by 78
Borgelt, C. (2005) · doi:10.1145/1133905.1133914 · Cited by 72
Romero, C., Zafra, A., Luna, J. M., & Ventura, S. (2012) · Expert Systems · doi:10.1111/j.1468-0394.2012.00627.x · Cited by 71
Self-citationMining Numeric Association Rules with Genetic Algorithms
Vázquez, J. M., Alvarez, J. L., & Riquelme, J. C. (2001) · Artificial Neural Nets and Genetic Algorithms · doi:10.1007/978-3-7091-6230-9_65 · Cited by 70
Luna, J. M., Romero, J. R., & Ventura, S. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-011-0419-z · Cited by 66
Self-citationSimple Algorithms for Frequent Item Set Mining
Borgelt, C. (2009) · Studies in computational intelligence · doi:10.1007/978-3-642-05179-1_16 · Cited by 63
Unsupervised Rare Pattern Mining: A Survey
Koh, Y. S., & Ravana, S. D. (2016) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2898359 · Cited by 63
Frequent Itemsets Mining for Big Data: A Comparative Analysis
Apiletti, D., Baralis, E., Cerquitelli, T., Garza, P., Pulvirenti, F., & Venturini, L. (2017) · Big Data Research · doi:10.1016/j.bdr.2017.06.006 · Cited by 55
Exploiting GPU and cluster parallelism in single scan frequent itemset mining
Djenouri, Y., Djenouri, D., Belhadi, A., & Cano, A. (2018) · Information Sciences · doi:10.1016/j.ins.2018.07.020 · Cited by 53
Mining association rules on Big Data through MapReduce genetic programming
Padillo, F., Luna, J. M., Herrera, F., & Ventura, S. (2017) · Integrated Computer-Aided Engineering · doi:10.3233/ica-170555 · Cited by 48
Self-citationReducing gaps in quantitative association rules: A genetic programming free-parameter algorithm
Luna, J. M., Romero, J. R., Romero, C., et al. (2014) · Integrated Computer-Aided Engineering · doi:10.3233/ica-140467 · Cited by 45
Self-citationMRQAR: A generic MapReduce framework to discover quantitative association rules in big data problems
Martín, D., Martínez-Ballesteros, M., García‐Gil, D., Alcalá‐Fdez, J., Herrera, F., & Riquelme, J. C. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.04.037 · Cited by 39
BIGMiner: a fast and scalable distributed frequent pattern miner for big data
Chon, K.-W., & Kim, M. (2018) · Cluster Computing · doi:10.1007/s10586-018-1812-0 · Cited by 36
Noaman, A. Y. M., Luna, J. M., Ragab, A. H. M., & Ventura, S. (2016) · International Journal of Computational Intelligence Systems · doi:10.1080/18756891.2016.1256573 · Cited by 17
Self-citation
Cited by
Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures
Koukaras, P., & Tjortjis, C. (2025) · Big Data and Cognitive Computing · doi:10.3390/bdcc9100258 · Cited by 3
Metadata
- Authors
- Luna, J. M., Fournier‐Viger, P., & Ventura, S.
- Venue
- WIREs Data Mining and Knowledge Discovery
- Publisher
- Wiley
- Published
- 2019-07-16
- Volume
- 9
- Issue
- 6
- ISSN
- 1942-4787 (ISSN-L)
- 1942-4795
- OpenAlex
- W2961234535
- Cited by
- 258
- References
- 58
- FWCI
- 34.05
- 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.
