Cited by 14,907Data Mining Algorithms and ApplicationsAdvanced Database Systems and QueriesData Mining and Machine Learning Applications

Mining association rules between sets of items in large databases

Open access
Agrawal, Rakesh, Imieliński, Tomasz, Swami, Arun·1993·Proceedings of the 1993 ACM SIGMOD international conference on Management of data

Abstract

We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel estimation and pruning techniques. We also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/170035.170072

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 7

  1. Swami, "Database Mining: A Performance Per- spective", IEEE Transactions on Knowledge and Data Engineering, Special Issue on Learning and Discovery in Knowledge-Based Databases, (to ap- pear).
  2. Rakesh Agrawal, Sakti Ghosh, Tomasz Imielinski, Bala Iyer, and Arun Swami, "An Interval Classifier for Database Mining Applications", VLDB-92, Vancouver, British Columbia, 1992, 560-573.
  3. B. Falkenhainer and R. Michalski, "Integrat- ing Quantitative and Qualitative Discovery: The ABACUS System", Machine Learning, 1(4): 367- 401.
  4. M. Kokar, "Discovering Functional Formulas through Changing Representation Base", Proceed- ings of the Fifih National Conference on Artificial Intelligence, 1986,455-459.
  5. P. Langley, H. Simon, G. Bradshaw, and J. Zytkow, Scientific Discovery: Computational Explorations of the Creative Process, The MIT Press, Cam- bridge, Mass., 1987.
  6. G. Piatetsky-Shapiro (Editor), Knowledge Discov- ery in Databases, AAAI/MIT Press, 1991.
  7. L.G. Valiant, "Learning Disjunctions and Conjunc- tions", IJCAI-85, Los Angeles, 1985, 560-565.

Cited by

Sorted by citations

Authors
Agrawal, R., Imieliński, T., & Swami, A.
Affiliations
  • IBM Research - Almaden (US)
  • Rutgers, The State University of New Jersey (US)
Venue
Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Publisher
ACM
Published
1993-06
Pages
207-216
ISSN
0730-8078 (ISSN-L)
OpenAlex
W2166559705
Cited by
14,907
References
2
Citations by year
2026: 140 · 2025: 231 · 2024: 223 · 2023: 271 · 2022: 304 · 2021: 486 · 2020: 514 · 2019: 560 · 2018: 617 · 2017: 653 · 2016: 644 · 2015: 714 · 2014: 832 · 2013: 803 · 2012: 863
FWCI
39.75
Type
conference paper
Language
en
Open access
Locations
ACM SIGMOD International Conference on Management of Data (SIGMOD) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Database Systems and Queries
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
Keywords
association rule mining, frequent itemset mining, transactional databases, buffer management, pruning techniques, estimation methods, retail sales data, consumer behavior

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