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.
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.
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
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
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
Self-citationIntroduction to lattices and order
(1991) · Choice Reviews Online · doi:10.5860/choice.28-3334 · Cited by 1,122
Sampling Large Databases for Association Rules
Toivonen, H. T. T. (1996) · Cited by 1,089
Parallel mining of association rules
Agrawal, R., & Shafer, J. C. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553164 · Cited by 1,064
Using a hash-based method with transaction trimming for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1997) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.634757 · Cited by 440
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
Integrating association rule mining with relational database systems: alternatives and implications
Sarawagi, S., Thomas, S., & Agrawal, R. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276335 · Cited by 306
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
Self-citationPincer-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
Set-oriented mining for association rules in relational databases
Houtsma, M., & Swami, A. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380413 · Cited by 263
Scalable parallel data mining for association rules
Han, E.-H., Karypis, G., & Kumar, V. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253330 · Cited by 262
Evaluation of sampling for data mining of association rules
Zaki, M. J., Parthasarathy, S., Li, W., & Ogihara, M. (2002) · Proceedings Seventh International Workshop on Research Issues in Data Engineering. High Performance Database Management for Large-Scale Applications · doi:10.1109/ride.1997.583696 · Cited by 177
Self-citationData mining, hypergraph transversals, and machine learning (extended abstract)
Gunopulos, D., Mannila, H., Khardon, R., & Toivonen, H. (1997) · Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/263661.263684 · Cited by 160
Data mining, hypergraph transversals, and machine learning
Gunopulos, D., Khardon, R., Mannila, H., & Toivonen, H. T. T. (1997) · Cited by 159
Arboricity and bipartite subgraph listing algorithms
Eppstein, D. (1994) · Information Processing Letters · doi:10.1016/0020-0190(94)90121-x · Cited by 157
A 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
An efficient approach to discovering knowledge from large databases
Yen, S.-J., & Chen, A. L. P. (2002) · International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568663 · Cited by 68
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
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-citation
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.