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

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

Scalable algorithms for association mining

Zaki, M.J. · 2000 · IEEE Transactions on Knowledge and Data Engineering

Abstract

Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming conditional implication rules among them. We present efficient algorithms for the discovery of frequent itemsets which forms the compute intensive phase of the task. The algorithms utilize the structural properties of frequent itemsets to facilitate fast discovery. The items are organized into a subset lattice search space, which is decomposed into small independent chunks or sublattices, which can be solved in memory. Efficient lattice traversal techniques are presented which quickly identify all the long frequent itemsets and their subsets if required. We also present the effect of using different database layout schemes combined with the proposed decomposition and traversal techniques. We experimentally compare the new algorithms against the previous approaches, obtaining improvements of more than an order of magnitude for our test databases.

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

Cites

27 of 27 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.

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.

Citations

Cites

Research works printed but not linked: 7

  1. gunopulos, 1997, discovering all the most specific sentences by randomized algorithms, Int l Conf Database Theory
  2. 10.1016/0196-6774(92)90012-2 · doi:10.1016/0196-6774(92)90012-2
  3. kuznetsov, 1989, interpretation on graphs and complexity characteristics of a search for specific patterns, Nauchn Tekh Inf Ser 2 (Automatic Document Math Linguist), 23, 23
  4. 10.1109/ICDE.1998.655811 · doi:10.1109/icde.1998.655811
  5. 10.1145/321694.321698 · doi:10.1145/321694.321698
  6. sarawagi, 1998, integrating association rule mining with databases: alternatives and implications, ACM SIGMOD Int l Conf Management of Data, 10.1145/276305.276335 · doi:10.1145/276305.276335
  7. parthasarathy, 1998, memory placement techniques for parallel association mining, Fourth Int l Conf Knowledge Discovery and Data Mining

Cited by

See all 1,751

Metadata

Authors
Zaki, M. J.
Venue
IEEE Transactions on Knowledge and Data Engineering
Published
2000
Volume
12
Issue
3
Pages
372-390
ISSN
1041-4347 (ISSN-L)
OpenAlex
W2099404336
Cited by
1,751
References
27
FWCI
56.95
Type
journal article
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

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.