The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Interestingness measures for data mining: A survey
Abstract
Interestingness measures play an important role in data mining, regardless of the kind of patterns being mined. These measures are intended for selecting and ranking patterns according to their potential interest to the user. Good measures also allow the time and space costs of the mining process to be reduced. This survey reviews the interestingness measures for rules and summaries, classifies them from several perspectives, compares their properties, identifies their roles in the data mining process, gives strategies for selecting appropriate measures for applications, and identifies opportunities for future research in this area.
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
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
From data mining to knowledge discovery: an overview
Fayyad, U. M., Piatetsky-Shapiro, G., & Smyth, P. (1996) · Knowledge Discovery and Data Mining · Cited by 2,395
Distance-based outliers: algorithms and applications
Knorr, E. M., Ng, R. T., & Tucakov, V. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050006 · Cited by 1,195 · cited 2×
“Peculiar patterns are generated from peculiar data (or outliers), which are relatively few in number and significantly different from the rest of the data [Knorr et al. 2000; Zhong et al. 2003].”
BackgroundQuinlan (2003) · Cited by 1,000
Discovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
Murthy, S. K. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009744630224 · Cited by 991
Selecting the right interestingness measure for association patterns
Tan, P.-N., Kumar, V., & Srivastava, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775053 · Cited by 862
Rule induction with CN2: Some recent improvements
Clark, P., & Boswell, R. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017011 · Cited by 859
Proceedings of the 27th International Conference on Very Large Data Bases
Apers, P. M. G., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., & Snodgrass, R. T. (2001) · Cited by 845
Classification and Regression Trees
Gehrke, J. (2005) · Encyclopedia of Data Warehousing and Mining · doi:10.4018/978-1-59140-557-3.ch027 · Cited by 730
Proceedings 2002 IEEE International Conference on Data Mining. ICDM 2002
(2002) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183878 · Cited by 727
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
Mining the most interesting rules
Bayardo, R. J., & Agrawal, R. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312219 · Cited by 653
Exploring Data Tables, Trends and Shapes.
Beaumont, C., Hoaglin, D. C., Mosteller, F., & Tukey, J. W. (1986) · The Statistician · doi:10.2307/2987762 · Cited by 615
A Foundational Approach to Mining Itemset Utilities from Databases
Yao, H., Hamilton, H. J., & Butz, C. J. (2004) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.51 · Cited by 569
Self-citationOn subjective measures of interestingness in knowledge discovery
Silberschatz, A., & Tuzhilin, A. (1995) · Knowledge Discovery and Data Mining · Cited by 447
Explora: a multipattern and multistrategy discovery assistant
Klösgen, W. (1996) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 438
Proceedings of the 2012 SIAM International Conference on Data Mining
(2012) · doi:10.1137/1.9781611972825 · Cited by 417
Chan, R., Yang, Q., & Shen, Y.-D. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250893 · Cited by 405
Boolean Feature Discovery in Empirical Learning
Pagallo, G., & Haussler, D. (1990) · Machine Learning · doi:10.1023/a:1022611825350 · Cited by 390
Rule Evaluation Measures: A Unifying View
Lavrač, N., Flach, P., & Zupan, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48751-4_17 · Cited by 387
Mining itemset utilities from transaction databases
Yao, H., & Hamilton, H. J. (2005) · Data & Knowledge Engineering · doi:10.1016/j.datak.2005.10.004 · Cited by 371
Self-citationMining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., & Lakhal, L. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44957-4_65 · Cited by 348
Proceedings of the 19th International Conference on Extending Database Technology, EDBT
Pitoura, E., Maabout, S., Koutrika, G., et al. (2016) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 337
Discovery-driven exploration of OLAP data cubes
Sarawagi, S., Agrawal, R., & Megiddo, N. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0100984 · Cited by 332
A survey of interestingness measures for knowledge discovery
MCGARRY, K. (2005) · The Knowledge Engineering Review · doi:10.1017/s0269888905000408 · Cited by 318
Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining
Heckerman, D. E., Uthurusamy, R., Mannila, H., & Pregibon, D. (1997) · AAAI Press eBooks · Cited by 271
Minimum description length induction, Bayesianism, and Kolmogorov complexity
Vitanyi, P. M. B., & Li, M. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825807 · Cited by 251
The interestingness of deviations
Piatetsky-Shapiro, G., & Matheus, C. J. (1994) · Cited by 249
A belief-driven method for discovering unexpected patterns
Padmanabhan, B. (1998) · Cited by 239
ROC ?n? Rule Learning?Towards a Better Understanding of Covering Algorithms
F�rnkranz, J., & Flach, P. A. (2005) · Machine Learning · doi:10.1007/s10994-005-5011-x · Cited by 230
Using general impressions to analyze discovered classification rules
Liu, B., Hsu, W., & Chen, S. (1997) · Cited by 219
An Analysis of Quantitative Measures Associated with Rules
Yao, Y. Y., & Zhong, N. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48912-6_64 · Cited by 206
Detecting change in categorical data: mining contrast sets
Bay, S. D., & Pazzani, M. J. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312263 · Cited by 193
Finding interesting patterns using user expectations
Liu, B., Hsu, W., Mun, L.-F., & Lee, H.-Y. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.824588 · Cited by 156
Small is beautiful: discovering the minimal set of unexpected patterns
Padmanabhan, B., & Tuzhilin, A. (2000) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/347090.347103 · Cited by 154
On objective measures of rule surprisingness
Freitas, A. A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0094799 · Cited by 140
Interestingness of discovered association rules in terms of neighborhood-based unexpectedness
Dong, G., & Li, J. (1998) · Lecture notes in computer science · doi:10.1007/3-540-64383-4_7 · Cited by 97
Profit Mining: From Patterns to Actions
Wang, K., Zhou, S., & Han, J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45876-x_7 · Cited by 90
Mining weighted association rules
Lu, S., Hu, H., & Li, F. (2001) · Intelligent Data Analysis · doi:10.3233/ida-2001-5303 · Cited by 85
Extracting Share Frequent Itemsets with Infrequent Subsets
Barber, B., & Hamilton, H. J. (2003) · Data Mining and Knowledge Discovery · doi:10.1023/a:1022419032620 · Cited by 78
Self-citationObjective-oriented utility-based association mining
Shen, Y.-D., Zhang, Z., & Yang, Q. (2003) · Proceedings · doi:10.1109/icdm.2002.1183938 · Cited by 76
A General Measure of Rule Interestingness
Jaroszewicz, S., & Simovici, D. A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44794-6_21 · Cited by 48
Share based measures for itemsets
Carter, C. L., Hamilton, H. J., & Cercone, N. J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63223-9_102 · Cited by 48
Self-citationGenerality Is Predictive of Prediction Accuracy
Webb, G. I., & Brain, D. (2006) · Lecture notes in computer science · doi:10.1007/11677437_1 · Cited by 16
Cited by
Loyola-Gonzalez, O. (2019) · IEEE Access · doi:10.1109/access.2019.2949286 · Cited by 559
Towards an explanatory and computational theory of scientific discovery
Chen, C., Chen, Y., Horowitz, M., Hou, H., Liu, Z., & Pellegrino, D. (2009) · Journal of Informetrics · doi:10.1016/j.joi.2009.03.004 · Cited by 426
Borgelt, C. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1074 · Cited by 291
A Survey of Utility-Oriented Pattern Mining
Gan, W., Lin, J. C.-W., Fournier-Viger, P., Chao, H.-C., Tseng, V. S., & Yu, P. S. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2942594 · Cited by 257
Business Intelligence for Enterprise Systems: A Survey
Duan, L., & Xu, L. D. (2012) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2188804 · Cited by 254
Metadata
- Authors
- Geng, L., & Hamilton, H. J.
- Venue
- ACM Computing Surveys
- Published
- 2006-09-30
- Volume
- 38
- Issue
- 3
- Pages
- 9
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2102297485
- Cited by
- 1,141
- References
- 48
- FWCI
- 111.69
- 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.