Parallel Algorithms for Discovery of Association Rules
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
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
(1979) · Cited by 43,841
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
The KDD process for extracting useful knowledge from volumes of data
Fayyad, U., Piatetsky-Shapiro, G., & Smyth, P. (1996) · Communications of the ACM · doi:10.1145/240455.240464 · Cited by 1,934
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
Parallel 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
Efficient algorithms for discovering association rules
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1994) · Cited by 624
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
Efficient mining of association rules in distributed databases
Cheung, D. W., Ng, V. T., Fu, A. W., & Fu, Y. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553158 · Cited by 345
Set-oriented mining for association rules in relational databases
Houtsma, M., & Swami, A. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380413 · Cited by 263
Scalable 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
Evaluation of sampling for data mining of association rules
Zaki, M. J., Parthasarathy, S., Li, W., & Ogihara, M. (2002) · Proceedings Seventh International Workshop on Research Issues in Data Engineering. High Performance Database Management for Large-Scale Applications · doi:10.1109/ride.1997.583696 · Cited by 177
Self-citationParallel 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-citationA localized algorithm for parallel association mining
Zaki, M. J., Parthasarathy, S., & Li, W. (1997) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/258492.258524 · Cited by 78
Self-citation
Cited by
SPADE: An Efficient Algorithm for Mining Frequent Sequences
Zaki, M. J. (2001) · Machine Learning · doi:10.1023/a:1007652502315 · Cited by 1,858
Self-citationDiscovering Frequent Closed Itemsets for Association Rules
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_25 · Cited by 1,378
Detecting Group Differences: Mining Contrast Sets
Bay, S. D., & Pazzani, M. J. (2001) · Data Mining and Knowledge Discovery · doi:10.1023/a:1011429418057 · Cited by 370
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-citationPincer-search: A new algorithm for discovering the maximum frequent set
Lin, D.-I., & Kedem, Z. M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0100980 · Cited by 277
Metadata
- Authors
- Zaki, M. J., Parthasarathy, S., Ogihara, M., Li, W., Stolorz, P., & Musick, R.
- Venue
- Scalable High Performance Computing for Knowledge Discovery and Data Mining
- Publisher
- Springer US
- Published
- 1997
- Pages
- 5-35
- OpenAlex
- W4243450781
- Cited by
- 264
- References
- 15
- FWCI
- 32.72
- Type
- book chapter
- 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.