The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Evaluation of sampling for data mining of association rules
Abstract
The discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the database to determine the commonly occurring item sets (or set of items). For large databases, the I/O overhead in scanning the database can be extremely high. The authors show that random sampling of transactions in the database is an effective method for finding association rules. Sampling can speed up the mining process by more than an order of magnitude by reducing I/O costs and drastically shrinking the number of transactions to be considered. They may also be able to make the sampled database resident in main-memory. Furthermore, they show that sampling can accurately represent the data patterns in the database with high confidence. They experimentally evaluate the effectiveness of sampling on different databases, and study the relationship between the performance, accuracy, and confidence of the chosen sample.
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
Scalable algorithms for association mining
Zaki, M. J. (2000) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.846291 · Cited by 1,751
Self-citationParallel Algorithms for Discovery of Association Rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Li, W. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009773317876 · Cited by 305
Self-citationA Survey of Methods for Scaling Up Inductive Algorithms
Provost, F., & Kolluri, V. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009876119989 · Cited by 277
Parallel Algorithms for Discovery of Association Rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., Li, W., Stolorz, P., & Musick, R. (1997) · Scalable High Performance Computing for Knowledge Discovery and Data Mining · doi:10.1007/978-1-4615-5669-5_1 · Cited by 264
Self-citation
Metadata
- Authors
- Zaki, M. J., Parthasarathy, S., Li, W., & Ogihara, M.
- Venue
- Proceedings Seventh International Workshop on Research Issues in Data Engineering. High Performance Database Management for Large-Scale Applications
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-22
- Pages
- 42-50
- OpenAlex
- W1599507890
- Cited by
- 177
- References
- 1
- FWCI
- 9.44
- 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: Evaluation of sampling for data mining of association rules. https://app.cochat.ai/papers/10.1109/ride.1997.583696
- The paper
- Zaki, M. J., Parthasarathy, S., Li, W., & Ogihara, M. (2002). Evaluation of sampling for data mining of association rules. Proceedings Seventh International Workshop on Research Issues in Data Engineering. High Performance Database Management for Large-Scale Applications. https://doi.org/10.1109/ride.1997.583696
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.