The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Algorithms for association rule mining — a general survey and comparison
Open accessAbstract
Today there are several efficient algorithms that cope with the popular and computationally expensive task of association rule mining.Actually, these algorithms are more or less described on their own.In this paper we explain the fundamentals of association rule mining and moreover derive a general framework.Based on this we describe today's approaches in context by pointing out common aspects and differences.After that we thoroughly investigate their strengths and weaknesses and carry out several runtime experiments.It turns out that the runtime behavior of the algorithms is much more similar as to be expected.
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
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
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
Mining generalized association rules
Srikant, R., & Agrawal, R. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00019-8 · Cited by 1,618
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233311 · Cited by 1,480
Discovery of Frequent Episodes in Event Sequences
Mannila, H., Toivonen, H., & Inkeri Verkamo, A. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009748302351 · Cited by 1,463
Discovering 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
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253327 · Cited by 1,281
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
Mining association rules with item constraints
Srikant, R., Vu, Q., & Agrawal, R. (1997) · Cited by 766
Exploratory mining and pruning optimizations of constrained associations rules
Ng, R. T., Lakshmanan, L. V. S., Han, J., & Pang, A. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276307 · Cited by 715
Finding interesting rules from large sets of discovered association rules
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., & Verkamo, A. I. (1994) · Proceedings of the third international conference on Information and knowledge management - CIKM '94 · doi:10.1145/191246.191314 · Cited by 712
Constraint-based rule mining in large, dense databases
Bayardo, R. J., Agrawal, R., & Gunopulos, D. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754924 · Cited by 362
Scalable Techniques for Mining Causal Structures
Silverstein, C., Brin, S., Motwani, R., & Ullman, J. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009891813863 · Cited by 319
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
Online association rule mining
Hidber, C. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304195 · Cited by 222
An efficient algorithm for the incremental updation of association rules in large databases
Thomas, S., Bodagala, S., Alsabti, K., & Ranka, S. (1997) · Cited by 215
Mining optimized association rules for numeric attributes
Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1996) · Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/237661.237708 · Cited by 210
Query flocks: a generalization of association-rule mining
Tsur, D., Ullman, J. D., Abiteboul, S., Clifton, C., Motwani, R., Nestorov, S., & Rosenthal, A. S. (1998) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/276304.276306 · Cited by 159
Finding interesting associations without support pruning
Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J. D., & Yang, C. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2000.839448 · Cited by 118
Online association rule mining
Hidber, C. (1999) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/304182.304195 · Cited by 114
An efficient algorithm to update large itemsets with early pruning
Ayan, N. F., Tansel, A. U., & Arkun, E. (1999) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/312129.312252 · Cited by 104
Mining Optimized Association Rules for Numeric Attributes
Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1999) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1595 · Cited by 89
Cited by
Biclustering algorithms for biological data analysis: a survey
Madeira, S. C., & Oliveira, A. L. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.2 · Cited by 2,049
Knowledge graph refinement: A survey of approaches and evaluation methods
Paulheim, H. (2016) · Semantic Web · doi:10.3233/sw-160218 · Cited by 849
Data mining in manufacturing: a review based on the kind of knowledge
Choudhary, A. K., Harding, J. A., & Tiwari, M. K. (2009) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-008-0145-x · Cited by 494
Business intelligence: data mining and optimization for decision making
Vercellis, C., Ahmadi, A., & Mohebi, A. (2016) · doi:10.5281/zenodo.13983826 · Cited by 398
Human Activity Recognition Data Analysis: History, Evolutions, and New Trends
Ariza-Colpas, P. P., Vicario, E., Oviedo-Carrascal, A. I., Butt Aziz, S., Piñeres-Melo, M. A., Quintero-Linero, A., & Patara, F. (2022) · Sensors · doi:10.3390/s22093401 · Cited by 52
Metadata
- Authors
- Hipp, J., Güntzer, U., & Nakhaeizadeh, G.
- Venue
- ACM SIGKDD Explorations Newsletter
- Published
- 2000-06
- Volume
- 2
- Issue
- 1
- Pages
- 58-64
- ISSN
- 1931-0145 (ISSN-L)
- 1931-0153
- OpenAlex
- W2045487373
- Cited by
- 962
- References
- 28
- FWCI
- 67.75
- 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.
