The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Online association rule mining
Open accessAbstract
We present a novel algorithm to compute large itemsets online. The user is free to change the support threshold any time during the first scan of the transaction sequence. The algorithm maintains a superset of all large itemsets and for each itemset a shrinking, deterministic interval on its support. After at most 2 scans the algorithm terminates with the precise support for each large itemset. Typically our algorithm is by an order of magnitude more memory efficient than Apriori or DIC.
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
Cited by
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
Maintaining Data Privacy in Association Rule Mining
Rizvi, S. J., & Haritsa, J. R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50066-4 · Cited by 485
Metadata
- Authors
- Hidber, C.
- Venue
- ACM SIGMOD Record
- Published
- 1999-06
- Volume
- 28
- Issue
- 2
- Pages
- 145-156
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2042875144
- Cited by
- 222
- References
- 1
- FWCI
- 32.32
- Type
- journal article
- 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: Online association rule mining. https://app.cochat.ai/papers/10.1145/304181.304195
- The paper
- Hidber, C. (1999). Online association rule mining. ACM SIGMOD Record. https://doi.org/10.1145/304181.304195
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.
