The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Scalable algorithms for association mining
Abstract
Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming conditional implication rules among them. We present efficient algorithms for the discovery of frequent itemsets which forms the compute intensive phase of the task. The algorithms utilize the structural properties of frequent itemsets to facilitate fast discovery. The items are organized into a subset lattice search space, which is decomposed into small independent chunks or sublattices, which can be solved in memory. Efficient lattice traversal techniques are presented which quickly identify all the long frequent itemsets and their subsets if required. We also present the effect of using different database layout schemes combined with the proposed decomposition and traversal techniques. We experimentally compare the new algorithms against the previous approaches, obtaining improvements of more than an order of magnitude for our test databases.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Hence, the ECLAT algorithm is more efficient and scalable in the area of association rule learning.”
From Machine learning: Algorithms, real-world applications and research directions (2021) · cites this paper as [131]
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
(1979) · Cited by 43,841
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 · cited 2×
“A lattice L is said to be distributive if for all X; Y ; Z 2 L , Z (cid:134) .”
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Introduction to Lattices and Order
Davey, B. A., & Priestley, H. A. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809088 · Cited by 4,901
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
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
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
Research works printed but not linked: 7
- gunopulos, 1997, discovering all the most specific sentences by randomized algorithms, Int l Conf Database Theory
- 10.1016/0196-6774(92)90012-2 · doi:10.1016/0196-6774(92)90012-2
- kuznetsov, 1989, interpretation on graphs and complexity characteristics of a search for specific patterns, Nauchn Tekh Inf Ser 2 (Automatic Document Math Linguist), 23, 23
- 10.1109/ICDE.1998.655811 · doi:10.1109/icde.1998.655811
- 10.1145/321694.321698 · doi:10.1145/321694.321698
- sarawagi, 1998, integrating association rule mining with databases: alternatives and implications, ACM SIGMOD Int l Conf Management of Data, 10.1145/276305.276335 · doi:10.1145/276305.276335
- parthasarathy, 1998, memory placement techniques for parallel association mining, Fourth Int l Conf Knowledge Discovery and Data Mining
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Machine learning: Algorithms, real-world applications and research directions
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00592-x · Cited by 5,583
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
Sarker, I. H. (2022) · SN Computer Science · doi:10.1007/s42979-022-01043-x · Cited by 1,208
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
CHARM: 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
Self-citationForecasting: theory and practice
Petropoulos, F., Apiletti, D., Assimakopoulos, V., Babai, M. Z., Barrow, D. K., Ben Taieb, S., Bergmeir, C., Bessa, R. J., Bijak, J., Boylan, J. E., et al. (2022) · International Journal of Forecasting · doi:10.1016/j.ijforecast.2021.11.001 · Cited by 921
Letham, B., Rudin, C., McCormick, T. H., & Madigan, D. (2015) · The Annals of Applied Statistics · doi:10.1214/15-aoas848 · Cited by 766
Cybersecurity data science: an overview from machine learning perspective
Sarker, I. H., Kayes, A. S. M., Badsha, S., Alqahtani, H., Watters, P., & Ng, A. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00318-5 · Cited by 766
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
Self-citationMAFIA: 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
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
Self-citationEfficient Algorithms for Mining High Utility Itemsets from Transactional Databases
Tseng, V. S., Shie, B.-E., Wu, C.-W., & Yu, P. S. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.59 · Cited by 570
arules- A Computational Environment for Mining Association Rules and Frequent Item Sets
Hahsler, M., Grün, B., & Hornik, K. (2005) · Journal of Statistical Software · doi:10.18637/jss.v014.i15 · Cited by 552
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00765-8 · Cited by 570
AI-Driven Cybersecurity: An Overview, Security Intelligence Modeling and Research Directions
Sarker, I. H. (2021) · doi:10.20944/preprints202101.0457.v1 · Cited by 550
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
AI-Driven Cybersecurity: An Overview, Security Intelligence Modeling and Research Directions
Sarker, I. H., Furhad, M. H., & Nowrozy, R. (2021) · SN Computer Science · doi:10.1007/s42979-021-00557-0 · Cited by 543
User feedback in the appstore: An empirical study
Pagano, D., & Maalej, W. (2013) · 2013 21st IEEE International Requirements Engineering Conference (RE) · doi:10.1109/re.2013.6636712 · Cited by 540
Big data for cyber physical systems in industry 4.0: a survey
Xu, L. D., & Duan, L. (2019) · Enterprise Information Systems · doi:10.1080/17517575.2018.1442934 · Cited by 526
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Wang, J., Jiang, C., Zhang, H., Ren, Y., Chen, K.-C., & Hanzo, L. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2965856 · Cited by 486
A taxonomy of sequential pattern mining algorithms
Mabroukeh, N. R., & Ezeife, C. I. (2010) · ACM Computing Surveys · doi:10.1145/1824795.1824798 · Cited by 400
Sarker, I. H., Khan, A. I., Abushark, Y. B., & Alsolami, F. (2023) · Mobile Networks and Applications · doi:10.1007/s11036-022-01937-3 · Cited by 398
Frequent substructure-based approaches for classifying chemical compounds
Deshpande, M., Kuramochi, M., Wale, N., & Karypis, G. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.127 · Cited by 371
An efficient algorithm for discovering frequent subgraphs
Kuramochi, M., & Karypis, G. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.33 · Cited by 352
Ceglar, A., & Roddick, J. F. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132958 · Cited by 324
Applications of text mining in services management: A systematic literature review
Kumar, S., Kar, A. K., & Ilavarasan, P. V. (2021) · International Journal of Information Management Data Insights · doi:10.1016/j.jjimei.2021.100008 · Cited by 317
Data science for building energy management: A review
Molina-Solana, M., Ros, M., Ruiz, M. D., Gómez-Romero, J., & Martin-Bautista, M. J. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2016.11.132 · Cited by 287
Profiling relational data: a survey
Abedjan, Z., Golab, L., & Naumann, F. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0389-y · Cited by 283
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
Frequent itemset mining: A 25 years review
Luna, J. M., Fournier‐Viger, P., & Ventura, S. (2019) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1329 · Cited by 258
Sarker, I. H. (2023) · Annals of Data Science · doi:10.1007/s40745-022-00444-2 · Cited by 256
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
Big Data Analytics: A Review on Theoretical Contributions and Tools Used in Literature
Grover, P., & Kar, A. K. (2017) · Global Journal of Flexible Systems Management · doi:10.1007/s40171-017-0159-3 · Cited by 219
Mobile Data Science and Intelligent Apps: Concepts, AI-Based Modeling and Research Directions
Sarker, I. H., Hoque, M. M., Uddin, M. K., & Alsanoosy, T. (2021) · Mobile Networks and Applications · doi:10.1007/s11036-020-01650-z · Cited by 207
FP-outlier: Frequent pattern based outlier detection
He, Z., Xu, X., Huang, Z., & Deng, S. (2005) · Computer Science and Information Systems · doi:10.2298/csis0501103h · Cited by 188
Digital Twin of City: Concept Overview
Ivanov, S., Nikolskaya, K., Radchenko, G., Sokolinsky, L., & Zymbler, M. (2020) · 2020 Global Smart Industry Conference (GloSIC) · doi:10.1109/glosic50886.2020.9267879 · Cited by 138
“For pattern mining, the main algorithms are Apriori [2], FP-Growth [15], and Eclat [43], and their numerous modifications including parallel versions [45].”
MethodMining class outliers: concepts, algorithms and applications in CRM
He, Z., Xu, X., Huang, J. Z., & Deng, S. (2004) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.07.002 · Cited by 79
Human Activity Recognition Data Analysis: History, Evolutions, and New Trends
Ariza-Colpas, P. P., Vicario, E., Oviedo-Carrascal, A. I., Butt Aziz, S., Piñeres-Melo, M. A., Quintero-Linero, A., & Patara, F. (2022) · Sensors · doi:10.3390/s22093401 · Cited by 52
“Frequent Itemsets Mining Apriori [60] Apriori-TID [61] ECLAT TID-list [62,63] FP-Growth [64] Big Data Algorithms R-Apriori [65] YAFIM [66] ParEclat [67] Par-FP (Parallel FP-Growth with Sampling) [68] HPA (Hash Partitioned Apriori) [69] Distributed algorithms PEAR (Parallel Efficient Association…”
Algorithmic and Ethical Aspects of Recommender Systems in e-Commerce
Paraschakis, D. (2018) · doi:10.24834/2043/24268 · Cited by 35
Industrial Big Data Analytics: Challenges and Opportunities
Al-Abassi, A., Karimipour, H., HaddadPajouh, H., Dehghantanha, A., & Parizi, R. M. (2020) · Handbook of Big Data Privacy · doi:10.1007/978-3-030-38557-6_3 · Cited by 32
Metadata
- Authors
- Zaki, M. J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2000
- Volume
- 12
- Issue
- 3
- Pages
- 372-390
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2099404336
- Cited by
- 1,751
- References
- 27
- FWCI
- 56.95
- 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.