The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Parallel and distributed association mining: a survey
Abstract
The author surveys the state of the art in parallel and distributed association-rule-mining algorithms and uncovers the field's challenges and open research problems. This survey can serve as a reference for both researchers and practitioners.
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
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
Dynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223813 · Cited by 1,406
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
Self-citationParallel mining of association rules
Agrawal, R., & Shafer, J. C. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553164 · Cited by 1,064
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · ACM SIGMOD Record · doi:10.1145/568271.223813 · Cited by 491
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
Parallel 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-citationScalable parallel data mining for association rules
Han, E.-H., Karypis, G., & Kumar, V. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253330 · Cited by 262
Efficient parallel data mining for association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · Proceedings of the fourth international conference on Information and knowledge management - CIKM '95 · doi:10.1145/221270.221320 · Cited by 201
Hash based parallel algorithms for mining association rules
Shintani, T., & Kitsuregawa, M. (2002) · International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568664 · Cited by 131
Parallel data mining for association rules on shared-memory multi-processors
Zaki, M. J., Ogihara, M., Parthasarathy, S., & Li, W. (1996) · ACM/IEEE Conference on Supercomputing (SC) · doi:10.1145/369028.369117 · Cited by 129
Self-citation
Cited by
Privacy preserving association rule mining in vertically partitioned data
Vaidya, J., & Clifton, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775142 · Cited by 1,001
“[SON95]. In particular, work in parallel data mining that may be relevant [ Zak99 ], [KC00].”
BackgroundBusiness intelligence: data mining and optimization for decision making
Vercellis, C., Ahmadi, A., & Mohebi, A. (2016) · doi:10.5281/zenodo.13983826 · Cited by 398
A fast high utility itemsets mining algorithm
Liu, Y., Liao, W.-K., & Choudhary, A. (2005) · Proceedings of the 1st international workshop on Utility-based data mining - UBDM '05 · doi:10.1145/1089827.1089839 · Cited by 364
Ceglar, A., & Roddick, J. F. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132958 · Cited by 324
Distributed data mining: a survey
Zeng, L., Li, L., Duan, L., Lu, K., Shi, Z., Wang, M., Wu, W., & Luo, P. (2012) · Information Technology and Management · doi:10.1007/s10799-012-0124-y · Cited by 85
“The most representative example of peer-to-peer distributed data mining is distributed association rule mining [60] and distributed decision tree [28].”
Metadata
- Authors
- Zaki, M. J.
- Venue
- IEEE Concurrency
- Published
- 1999-10
- Volume
- 7
- Issue
- 4
- Pages
- 14-25
- ISSN
- 1092-3063 (ISSN-L)
- 1558-0849
- OpenAlex
- W2004748427
- Cited by
- 475
- References
- 13
- FWCI
- 30.42
- 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.