Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 164

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

Efficient search for association rules

Open access
Webb, Geoffrey I. · 2000 · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining

Abstract

This paper argues that for some applications direct search for association rules can be more ecient than the tw o stage process of the Apriori algorithm which rst nds large itemsets whic hare then used to iden tify associations.In particular, it is argued, Apriori can impose large computational overheads when the number of frequen titemsets is very large.This will often be the case when association rule analysis is performed on domains other than basket analysis or when it is performed for basket analysis with basket information augmented b y other customer information.An algorithm is presented that is computationally ecient for association rule analyses during which the n um ber of rules to be found can be constrained and all data can be maintained in memory.

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/347090.347112

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

Cited by

See all 164

Metadata

Authors
Webb, G. I.
Venue
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Publisher
ACM
Published
2000-08
Pages
99-107
OpenAlex
W2096322311
Cited by
164
References
1
FWCI
10.38
Type
conference paper
Language
en
Open access
bronze

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: Efficient search for association rules. https://app.cochat.ai/papers/10.1145/347090.347112
The paper
Webb, G. I. (2000). Efficient search for association rules. Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/347090.347112

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.