CoChat

Rapid association rule mining

Das, Amitabha, Ng, Wee-Keong, Woon, Yew-Kwong · 2001 · Proceedings of the tenth international conference on Information and knowledge management
Cited by 84

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

Association rule mining is a well-researched area where many algorithms have been proposed to improve the speed of mining. In this paper, we propose an innovative algorithm called Rapid Association Rule Mining (RARM) to once again break this speed barrier. It uses a versatile tree structure known as the Support-Ordered Trie Itemset (SOTrieIT) structure to hold pre-processed transactional data. This allows RARM to generate large 1-itemsets and 2-itemsets quickly without scanning the database and without candidate 2-itemset generation. It achieves significant speed-ups because the main bottleneck in association rule mining using the Apriori property is the generation of candidate 2-itemsets. RARM has been compared with the classical mining algorithm Apriori and it is found that it outperforms Apriori by up to two orders of magnitude (100 times), much more than what recent mining algorithms are able to achieve.

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.

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

Integrity signals

Registry

Crossref · 10.1145/502585.502665

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

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

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

Show all 1 references

Research works printed but not linked: 10

  1. 10.5555/645483.653616 · doi:10.5555/645483.653616
  2. R. Agrawal and R. Srikant . Fast algorithms for mining association rules . In Proc. 20th Int. Conf. on Very Large Databases , pages 487 - 499 , Santiago, Chile , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. on Very Large Databases, pages 487-499, Santiago, Chile, 1994.
  3. M. Berry and G. Linoff . Data mining techniques: for marketing, sales, and customer support . Wiley Computer Pub ., New York, 1997 . M. Berry and G. Linoff. Data mining techniques: for marketing, sales, and customer support. Wiley Computer Pub., New York, 1997.
  4. A. Berson , S. Smith , and K. Thearling . Building data mining applications for CRM . McGraw-Hill , New York , 2000 . A. Berson, S. Smith, and K. Thearling. Building data mining applications for CRM. McGraw-Hill, New York, 2000.
  5. 10.5555/645481.655582 · doi:10.5555/645481.655582
  6. 10.5555/646711.703155 · doi:10.5555/646711.703155
  7. 10.1145/342009.335372 · DOI · Paper page
  8. 10.1145/304182.304195 · DOI
  9. 10.1109/69.634757 · DOI · Paper page
  10. 10.5555/552315.791209 · doi:10.5555/552315.791209

Metadata

Authors
Das, A., Ng, W.-K., & Woon, Y.-K.
Venue
Proceedings of the tenth international conference on Information and knowledge management
Publisher
ACM
Published
2001-10-05
Pages
474-481
OpenAlex
W1965702297
Cited by
84
References
1
FWCI
1.63
Type
conference paper
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: Rapid association rule mining. https://app.cochat.ai/papers/10.1145/502585.502665
The paper
Das, A., Ng, W.-K., & Woon, Y.-K. (2001). Rapid association rule mining. Proceedings of the tenth international conference on Information and knowledge management. https://doi.org/10.1145/502585.502665

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.