The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
Association mining
Abstract
The task of finding correlations between items in a dataset, association mining, has received considerable attention over the last decade. This article presents a survey of association mining fundamentals, detailing the evolution of association mining algorithms from the seminal to the state-of-the-art. This survey focuses on the fundamental principles of association mining, that is, itemset identification, rule generation, and their generic optimizations.
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 · cited 8×
“INTRODUCTION Association (rule) mining, the task of .nding correlations between items in a dataset, has received considerable attention, particularly since the publication of the AIS and Apriori algorithms [Agrawal et al. 1993; Agrawal and Srikant 1994].”
BackgroundInfluentialFast 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
Formal Concept Analysis: Mathematical Foundations
Ganter, B., Wille, R., & Franzke, C. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,245
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
SPADE: An Efficient Algorithm for Mining Frequent Sequences
Zaki, M. J. (2001) · Machine Learning · doi:10.1023/a:1007652502315 · Cited by 1,858
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
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233311 · Cited by 1,480
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
Department of Computer Science
(1993) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)90083-n · Cited by 1,210
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
Sampling Large Databases for Association Rules
Toivonen, H. T. T. (1996) · Cited by 1,089
Algorithms for association rule mining — a general survey and comparison
Hipp, J., Güntzer, U., & Nakhaeizadeh, G. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/360402.360421 · Cited by 962
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
Efficient mining of association rules using closed itemset lattices
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999) · Information Systems · doi:10.1016/s0306-4379(99)00003-4 · Cited by 768
Proceedings 2001 IEEE International Conference on Data Mining
(2001) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989492 · Cited by 768
Proceedings 2002 IEEE International Conference on Data Mining. ICDM 2002
(2002) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183878 · Cited by 727
What makes patterns interesting in knowledge discovery systems
Silberschatz, A., & Tuzhilin, A. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553165 · Cited by 679
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
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
Efficient algorithms for discovering association rules
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1994) · Cited by 624
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
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
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
Parallel and distributed association mining: a survey
Zaki, M. J. (1999) · IEEE Concurrency · doi:10.1109/4434.806975 · Cited by 475
Efficiently Using Prefix-trees in Mining Frequent Itemsets.
Grahne, G., & Zhu, J. (2003) · Cited by 457
Proceedings of the 26th International Conference on Data Engineering, ICDE 2010
Li, F., Moro, M. M., Ghandeharizadeh, S., Haritsa, J. R., Weikum, G., Carey, M. J., Casati, F., Chang, E. Y., Manolescu, I., Mehrotra, S., et al. (2010) · Max Planck Institute for Plasma Physics · Cited by 452
On subjective measures of interestingness in knowledge discovery
Silberschatz, A., & Tuzhilin, A. (1995) · Knowledge Discovery and Data Mining · Cited by 447
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
Pruning and summarizing the discovered associations
Liu, B., Hsu, W., & Ma, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312216 · Cited by 418
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) · ScholarlyCommons (University of Pennsylvania) · Cited by 388
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., & Lakhal, L. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44957-4_65 · Cited by 348
Proceedings of the 19th International Conference on Extending Database Technology, EDBT
Pitoura, E., Maabout, S., Koutrika, G., Marian, A., Tanca, L., Manolescu, I., & Stefanidis, K. (2016) · HAL · Cited by 344
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
Mining frequent itemsets with convertible constraints
Pei, J., Han, J., & Lakshmanan, L. V. S. (2002) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914856 · Cited by 324
Mining frequent patterns with counting inference
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., & Lakhal, L. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.381017 · Cited by 303
Mining All Non-derivable Frequent Itemsets
Calders, T., & Goethals, B. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45681-3_7 · Cited by 295
Mining frequent patterns by pattern-growth: methodology and implications
Han, J., & Pei, J. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.381002 · Cited by 280
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
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Boulicaut, J., Bykowski, A., & Rigotti, C. (2003) · Data Mining and Knowledge Discovery · doi:10.1023/a:1021571501451 · Cited by 267
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
A belief-driven method for discovering unexpected patterns
Padmanabhan, B. (1998) · Cited by 239
On rule interestingness measures
Freitas, A. A. (1999) · Knowledge-Based Systems · doi:10.1016/s0950-7051(99)00019-2 · Cited by 235
Bodon, F. (2003) · Cited by 232
Mining frequent item sets by opportunistic projection
Liu, J., Pan, Y., Wang, K., & Han, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775081 · Cited by 189
Small is beautiful: discovering the minimal set of unexpected patterns
Padmanabhan, B., & Tuzhilin, A. (2000) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/347090.347103 · Cited by 154
Overcoming limitations of sampling for aggregation queries
Chaudhuri, S., Das, G., Datar, M., Motwani, R., & Narasayya, V. R. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2001.914867 · Cited by 151
Top Down FP-Growth for Association Rule Mining
Wang, K., Liu, T., Han, J., & Liu, J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47887-6_34 · Cited by 141
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
A condensed representation to find frequent patterns
Bykowski, A., & Rigotti, C. (2001) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/375551.375604 · Cited by 125
The power of sampling in knowledge discovery
Kivinen, J., & Mannila, H. (1994) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/182591.182601 · Cited by 122
Evaluation of Interestingness Measures for Ranking Discovered Knowledge
Hilderman, R. J., & Hamilton, H. J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45357-1_28 · Cited by 113
Enhancing the Apriori Algorithm for Frequent Set Counting
Perego, R., Orlando, S., & Palmerini, P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44801-2_8 · Cited by 112
A new two-phase sampling based algorithm for discovering association rules
Chen, B., Haas, P. J., & Scheuermann, P. (2002) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775047.775114 · Cited by 111
Interestingness of discovered association rules in terms of neighborhood-based unexpectedness
Dong, G., & Li, J. (1998) · Lecture notes in computer science · doi:10.1007/3-540-64383-4_7 · Cited by 97
Concise Representations of Association Rules
Kryszkiewicz, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45728-3_8 · Cited by 90
Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012
Zhou, T., Shan, H., Banerjee, A., & Sapiro, G. (2012) · SIAM International Conference on Data Mining · Cited by 78
Mining Frequent Itemsets using Patricia Tries.
Pietracaprina, A., & Zandolin, D. (2003) · Cited by 77
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets.
Orlando, S., Lucchese, C., Palmerini, P., Perego, R., & Silvestri, F. (2003) · Cited by 71
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
Algorithms for computing association rules using a partial-support tree
Goulbourne, G., Coenen, F., & Leng, P. H. (2000) · Knowledge-Based Systems · doi:10.1016/s0950-7051(00)00055-1 · Cited by 64
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation.
Zai͏̈ane, O. R., & El-Hajj, M. (2003) · Cited by 58
Generating an informative cover for association rules
Cristofor, L., & Simovici, D. A. (2003) · Proceedings · doi:10.1109/icdm.2002.1184007 · Cited by 49
CT-ITL: efficient frequent item set mining using a compressed prefix tree with pattern growth
Sucahyo, Y. G., & Gopalan, R. P. (2003) · Australasian Database Conference · Cited by 35
What's interesting about Cricket?
Roddick, J. F., & Rice, S. (2001) · ACM SIGKDD Explorations Newsletter · doi:10.1145/507533.507535 · Cited by 27
Self-citation
Cited by
Data mining in course management systems: Moodle case study and tutorial
Romero, C., Ventura, S., & García, E. (2008) · Computers & Education · doi:10.1016/j.compedu.2007.05.016 · Cited by 1,058
Predicting students' final performance from participation in on-line discussion forums
Romero, C., López, M.-I., Luna, J.-M., & Ventura, S. (2013) · Computers & Education · doi:10.1016/j.compedu.2013.06.009 · Cited by 546
Big data analytics for preventive medicine
Razzak, M. I., Imran, M., & Xu, G. (2020) · Neural Computing and Applications · doi:10.1007/s00521-019-04095-y · Cited by 327
Sequential pattern mining -- approaches and algorithms
Mooney, C. H., & Roddick, J. F. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431218 · Cited by 310
Self-citationCricAI: A classification based tool to predict the outcome in ODI cricket
Kaluarachchi, A., & Varde, A. S. (2010) · 2010 Fifth International Conference on Information and Automation for Sustainability · doi:10.1109/iciafs.2010.5715668 · Cited by 71
Metadata
- Authors
- Ceglar, A., & Roddick, J. F.
- Venue
- ACM Computing Surveys
- Published
- 2006-07-25
- Volume
- 38
- Issue
- 2
- Pages
- 5
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2293888039
- Cited by
- 324
- References
- 69
- FWCI
- 78.78
- 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.