The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Selecting the right interestingness measure for association patterns
Abstract
Many techniques for association rule mining and feature selection require a suitable metric to capture the dependencies among variables in a data set. For example, metrics such as support, confidence, lift, correlation, and collective strength are often 'used to determine the interestingness of association patterns. However, many such measures provide conflicting information about the interestingness of a pattern, and the best metric to use for a given application domain is rarely known. In this paper, we present an overview of various measures proposed in the statistics, machine learning and data mining literature. We describe several key properties one should examine in order to select the right measure for a given application domain. A comparative study of these properties is made using twenty one of the existing measures. We show that each measure has different properties which make them useful for some application domains, but not for others. We also present two scenarios in which most of the existing measures agree with each other, namely, support-based pruning and table standardization. Finally, we present an algorithm to select a small set of tables such that an expert can select a desirable measure by looking at just this small set of tables.
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
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
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
Fleiss, J. L., & Agresti, A. (1991) · Journal of the American Statistical Association · doi:10.2307/2290537 · Cited by 2,641
Hand, D. J., Mannila, H., & Smyth, P. (2001) · Cited by 2,581
Computer Solution of Large Sparse Positive Definite Systems.
Pasciak, J. E., George, A., & Liu, J. W. (1982) · Mathematics of Computation · doi:10.2307/2007640 · Cited by 1,874
Knowledge Discovery in Databases
Piateski, G., & Frawley, W. (1991) · The MIT Press eBooks · Cited by 1,749
Smith, A. (2002) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(02)00058-1 · Cited by 1,700
Knowledge discovery in databases
FrawleyWilliam, J., Piatetsky-ShapiroGregory, & MatheusChristopher, J. (1992) · AI Magazine · doi:10.5555/140629.140633 · Cited by 1,055
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Discovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
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
What makes patterns interesting in knowledge discovery systems
Silberschatz, A., & Tuzhilin, A. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553165 · Cited by 679
Association and Estimation in Contingency Tables
Mosteller, F. (1968) · Journal of the American Statistical Association · doi:10.1080/01621459.1968.11009219 · Cited by 492
Pruning and summarizing the discovered associations
Liu, B., Hsu, W., & Ma, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312216 · Cited by 418
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules
Silverstein, C., Brin, S., & Motwani, R. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009713703947 · Cited by 368
Computer Solution of Large Sparse Positive Definite
George, A. D., & Liu, J. W. (1981) · Cited by 348
On biases in estimating multi-valued attributes
Kononenko, I. (1995) · International Joint Conference on Artificial Intelligence · Cited by 278
A new framework for itemset generation
Aggarwal, C. C., & Yu, P. S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275490 · Cited by 239
Evaluation of Interestingness Measures for Ranking Discovered Knowledge
Hilderman, R. J., & Hamilton, H. J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45357-1_28 · Cited by 113
Evaluating the interestingness of characteristic rules
Kamber, M., & Shinghal, R. (1996) · Knowledge Discovery and Data Mining · Cited by 91
Cited by
The Google Similarity Distance
Cilibrasi, R. L., & Vitanyi, P. M. B. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.48 · Cited by 1,760
Frequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
Interestingness measures for data mining: A survey
Geng, L., & Hamilton, H. J. (2006) · ACM Computing Surveys · doi:10.1145/1132960.1132963 · Cited by 1,141
Recent automatic text summarization techniques: a survey
Gambhir, M., & Gupta, V. (2017) · Artificial Intelligence Review · doi:10.1007/s10462-016-9475-9 · Cited by 727
The statistics of word cooccurrences : word pairs and collocations
Evert, S. (2005) · OPUS Publication Server of the University of Stuttgart (University of Stuttgart) · doi:10.18419/opus-2556 · Cited by 636
Metadata
- Authors
- Tan, P.-N., Kumar, V., & Srivastava, J.
- Venue
- Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2002-07-23
- Pages
- 32-41
- OpenAlex
- W2066277072
- Cited by
- 862
- References
- 21
- FWCI
- 26.54
- 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
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.