The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
An effective hash-based algorithm for mining association rules
Open accessAbstract
In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. The mining of association rules can be mapped into the problem of discovering large itemsets where a large itemset is a group of items which appear in a sufficient number of transactions. The problem of discovering large itemsets can be solved by constructing a candidate set of itemsets first and then, identifying, within this candidate set, those itemsets that meet the large itemset requirement. Generally this is done iteratively for each large k -itemset in increasing order of k where a large k -itemset is a large itemset with k items. To determine large itemsets from a huge number of candidate large itemsets in early iterations is usually the dominating factor for the overall data mining performance. To address this issue, we propose an effective hash-based algorithm for the candidate set generation. Explicitly, the number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods, thus resolving the performance bottleneck. Note that the generation of smaller candidate sets enables us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly. Extensive simulation study is conducted to evaluate performance of the proposed algorithm.
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.
Integrity signals
Registry
Cites
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.
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
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
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
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Discovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
Knowledge Discovery in Databases: An Attribute-Oriented Approach
Han, J., Cai, Y., & Cercone, N. J. (1992) · Cited by 388
File structures using hashing functions
Coffman, E. G., & Eve, J. K. (1970) · Communications of the ACM · doi:10.1145/362686.362693 · Cited by 100
Cited by
Data mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
Self-citationEfficient algorithms for mining closed itemsets and their lattice structure
Zaki, M. J., & Hsiao, C.-J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.60 · Cited by 681
Parallel and distributed association mining: a survey
Zaki, M. J. (1999) · IEEE Concurrency · doi:10.1109/4434.806975 · Cited by 475
A fast distributed algorithm for mining association rules
Cheung, D. W., Han, J., Ng, V. T., Fu, A. W., & Fu, Y. (2002) · Fourth International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568665 · Cited by 432
Visualization techniques for mining large databases: a comparison
Keim, D. A., & Kriegel, H.-P. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553159 · Cited by 374
Metadata
- Authors
- Park, J. S., Chen, M.-S., & Yu, P. S.
- Venue
- ACM SIGMOD Record
- Published
- 1995-05-22
- Volume
- 24
- Issue
- 2
- Pages
- 175-186
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W4248966671
- Cited by
- 491
- References
- 6
- FWCI
- 15.69
- 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
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.