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.
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
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
Cited by
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
Association analysis of moodle e‐tests in blended learning educational environment
Dimić, G., Predić, B., Rančić, D., Petrović, V., Maček, N., & Spalević, P. (2018) · Computer Applications in Engineering Education · doi:10.1002/cae.21894 · Cited by 17
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Association mining. https://app.cochat.ai/papers/10.1145/1132956.1132958
- The paper
- Ceglar, A., & Roddick, J. F. (2006). Association mining. ACM Computing Surveys. https://doi.org/10.1145/1132956.1132958
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.