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

The DOI matches its Crossref record.

A fast distributed algorithm for mining association rules

Cheung, D.W., Jiawei Han, Ng, V.T., Fu, A.W., Yongjian Fu·2002·Fourth International Conference on Parallel and Distributed Information Systems

Abstract

With the existence of many large transaction databases, the huge amounts of data, the high scalability of distributed systems, and the easy partitioning and distribution of a centralized database, it is important to investigate efficient methods for distributed mining of association rules. The study discloses some interesting relationships between locally large and globally large item sets and proposes an interesting distributed association rule mining algorithm, FDM (fast distributed mining of association rules), which generates a small number of candidate sets and substantially reduces the number of messages to be passed at mining association rules. A performance study shows that FDM has a superior performance over the direct application of a typical sequential algorithm. Further performance enhancement leads to a few variations of the algorithm.

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.

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

Integrity signals

Registry

Crossref · 10.1109/pdis.1996.568665

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.

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

Cited by

See all 432

Metadata

Authors
Cheung, D. W., Han, J., Ng, V. T., Fu, A. W., & Fu, Y.
Venue
Fourth International Conference on Parallel and Distributed Information Systems
Published
2002-12-24
Pages
31-42
OpenAlex
W1906561224
Cited by
432
References
0
FWCI
16.33
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: A fast distributed algorithm for mining association rules. https://app.cochat.ai/papers/10.1109/pdis.1996.568665
The paper
Cheung, D. W., Han, J., Ng, V. T., Fu, A. W., & Fu, Y. (2002). A fast distributed algorithm for mining association rules. Fourth International Conference on Parallel and Distributed Information Systems. https://doi.org/10.1109/pdis.1996.568665

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.