Interestingness measures for data mining: A survey

ACM Computing Surveys

Volumn 38, Issue 3, 2006, Pages 3-

  Geng, Liqiang ^a   Hamilton, Howard J ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

Association rules; Classification rules; Interest measures; Interestingness measures; Knowledge discovery; Summaries

Indexed keywords

ASSOCIATION RULES; INTERESTINGNESS MEASURES; KNOWLEDGE DISCOVERY; SUMMARY;

CLASSIFICATION (OF INFORMATION); COSTS; KNOWLEDGE BASED SYSTEMS; PATTERN MATCHING; SURVEYING;

DATA MINING;

EID: 33749319347     PISSN: 03600300     EISSN: 03600300     Source Type: Journal    
DOI: 10.1145/1132960.1132963     Document Type: Review

References (60)

1. AGRAWAL, R. AND SRIKANT, R. 1994. Fast algorithms for mining association rules. In. Proceedings of the 20th International Conference on Very Large Databases. Santiago, Chile. 487-499.
2. BARBER, B. AND HAMILTON, H. J. 2008. Extracting share frequent itemsets with infrequent subsets. Data Mining Knowl. Discovery 7, 2, 153-185.
3. BASTIDE, Y., PASQUIER, N., TAOUIL, R., STUMME, G., AND LAKHAL, L. 2000. Mining minimal nonredundant association rules using frequent closed itemsets. In Proceedings of the 1st International Conference on Computational Logic. London, UK. 972-986.
4. BAY, S. D. AND PAZZANI, M. J. 1999. Detecting change in categorical data: Mining contrast sets. In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining (KDD-99). San Diego, CA. 302-306.
5. BAYARDO, R. J. AND AGRAWAL R. 1999. Mining the most interesting rules. In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining (KDD-99). San Diego, CA. 145-154.
6. BREIMAN, L., FREIDMAN, J., OLSHEN, R., AND STONE, C. 1984. Classification and Regression Trees. Wadsworth and Brooks, Pacific Grove, CA.
7. CAI, C. H., Fu, A. W., CHENG, C. H., AND KWONG, W. W. 1998. Mining association rules with weighted items. In Proceedings of the International Database Engineering and Applications Symposium (IDEAS '98). Cardiff, UK. 68-77.
8. CARTER, C. L., HAMILTON, H. J., AND CERCONE, N. 1997. Share-Based measures for itemsets. In Proceedings of the 1st European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD '97). Trondheim, Norway. 14-24.
9. CARVALHO, D. R. AND FREITAS, A. A. 2000. A genetic algorithm-based solution for the problem of small disjuncts. In Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2000). Lyon, France. 345-352.
10. CHAN, R., YANG, Q., AND SHEN, Y. 2003. Mining high-utility itemsets. In Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM '03). Melbourne, FL. 19-26.
11. CLARK, P. AND BOSWELL, R. 1991. Rule induction with CN2: Some recent improvements. In Proceedings of the 5th European Working Session on Learning (EWSL '91). Porto, Portugal. 151-163.
12. DONG, G. AND Li, J. 1998. Interestingness of discovered association rules in terms of neighborhood-based unexpectedness. In Proceedings of the 2nd Pacific Asia Conference on Knowledge Discovery in Databases (PAKDD-98). Melbourne, Australia. 72-86.
13. FABRIS, C. C. AND FREITAS, A. A. 2001. Incorporating deviation-detection functionality into the OLAP paradigm. In Proceedings of the 16th Brazilian Symposium on Databases (SBBD 2001). Rio de Janeiro, Brazil. 274-285.
14. FAYYAD, U. M., PIATETSKY-SHAPIRO, G., AND SMYTH, P. 1996. From data mining to knowledge discovery: An overview. In Advances in Knowledge Discovery and Data Mining, U. M. Fayyad et al., Eds. MIT Press. Cambridge, MA, 1-34.
15. FORSYTH, R. S., CLARKE, D. D., AND WRIGHT, R. L. 1994. Overfitting revisited: An information-theoretic approach to simplifying discrimination trees. J. Exp. Theor, Artif, Intell. 6, 289-302.
16. FREITAS, A. A. 1998. On objective measures of rule surprisingness. In Proceedings of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD '98). Nantes, France. 1-9.
17. FÜRNKRANZ, J. AND FLACH, P. A. 2005. ROC 'n' rule learning: Towards a better understanding of covering algorithms. Mach. Learn. 58, 1, 39-77.
18. GRAY, B. AND ORLOWSKA, M. E. 1998. CCAIIA: Clustering categorical attributes into interesting association rules. In Proceedings of the 2nd Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD-98). Melbourne, Australia. 132-143.
19. HAMILTON, H. J., GENG, L., FINDLATER, L., AND RANDALL, D. J. 2006. Efficient spatio-temporal data mining with GenSpace graphs. J. Appl. Logic 4, 2, 192-214.
20. HILDEHMAN, R. J., CARTER, C. L., HAMILTON, H. J., AND CERCONE, N. 1998. Mining market basket data using share measures and characterized itemsets. In Proceedings of the 2nd Pacific Asia Conference on Knowledge Discovery in Databases (PAKDD-98). Melbourne, Australia. 72-86.
21. HILDEHMAN, R. J. AND HAMILTON, H. J. 2001. Knowledge Discovery and Measures of Interest. Kluwer Academic, Boston, MA.
22. HOAGLIN, D. C., MOSTELLER, F., AND TUKEY, J. W., EDS. 1985. Exploring Data Tables, Trends, and Shapes. Wiley, New York.
23. JAROSZEWICZ, S. AND SIMOVICI, D. A. 2001. A general measure of rule interestingness. In Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2001). Freiburg, Germany. 253-265.
24. KLOSGEN, W. 1996. Explora: A multipattern and multistrategy discovery assistant. In Advances in Knowledge Discovery and Data Mining, U. M. Fayyad et al., Eds. MIT Press, Cambridge, MA, 249-271.
25. KNORR, E. M., NG, R. T., AND TUCAKOV, V. 2000. Distance based outliers: Algorithms and applications. Int. J. Very Large Databases 8, 237-253.
26. LAVHAC, N., FLACH, P., AND ZUPAN, B. 1999. Rule evaluation measures: A unifying view. In Proceedings of the 9th International Workshop on Inductive Logic Programming (ILP '99). Bled, Slovenia. Springer-Verlag, 174-185.
27. LENCA, P., MEYER, P., VAILLANT, B., AND LALLICH, S. 2004. A multicriteria decision aid for interestingness measure selection. Tech. Rep. LUSSI-TR-2004-01-EN, May 2004. LUSSI Department, GET/ENST, Bretagne, France.
28. Li, G. AND HAMILTON, H. J. 2004. Basic association rules. In Proceedings of the 4th SIAM International Conference on Data Mining. Orlando, FL. 166-177.
29. LING, C., CHEN, T., YANG, Q., AND CHEN, J. 2002. Mining optimal actions for profitable CRM. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM '02). Maebashi City, Japan.767-770.
30. Liu, B., HSU, W., AND CHEN, S. 1997. Using general impressions to analyze discovered classification rules. In Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD-97). Newport Beach, CA. 31-36.
31. Liu, B., Hsu, W., MUN, L., AND LEE, H. 1999. Finding interesting patterns using user expectations. IEEE Trans. Knowl. Data Eng. 11, 6, 817-832.
32. LU, S., HU, H., AND LI, F. 2001. Mining weighted association rules. Intell. Data Anal. 5, 3, 211-225.
33. MCGARHY, K. 2005. A survey of interestingness measures for knowledge discovery. Knowl. Eng. Review 20, 1, 39-61.
34. MURTHY, S. K. 1998. Automatic construction of decision trees from data: A multi-disciplinary survey. Data Mining Knowl. Discovery 2, 4, 345-389.
35. OHSAKI, M., KITAGUCHI, S., OKAMOTO, K., YOKOI, H., AND YAMAGUCHI, T. 2004. Evaluation of rule interestingness measures with a clinical dataset on hepatitis. In Proceedings of the 8th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2004). Pisa, Italy. 862-373.
36. PADMANABHAN, B. AND TUZHILIN, A. 1998. A belief-driven method for discovering unexpected patterns. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD-98). New York. 94-100.
37. PADMANABHAN, B. AND TUZHILIN, A. 2000. Small is beautiful: Discovering the minimal set of unexpected patterns. In Proceedings of the 6th International Conference on Knowledge Discovery and Data Mining (KDD 2000). Boston, MA. 54-63.
38. PAGALLO, G. AND HAUSSLER, D. 1990. Boolean feature discovery in empirical leaning. Mach. Learn. B, 1, 71-99.
39. PIATETSKST-SHAPIRO, G. 1991. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, G. Piatetsky-Shapiro and W. J. Frawley, Eds. MIT Press, Cambridge, MA, 229-248.
40. PIATETSKST-SHAPIRO, G. AND MATHEUS, C. 1994. The interestingness of deviations. In Proceedings of the AAAI-94 Workshop on Knowledge Discovery in Databases (KDD-94). Seattle, WA. 25-36.
41. QUINLAN, J. R. 1986. Induction of decision trees. Mach. Learn. 1, 1, 81-106.
42. SAHAR, S. 1999. Interestingness via what is not interesting. In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining (KDD-99). San Diego, CA. 332-336.
43. SARAWAGI, S. 1999. Explaining differences in multidimensional aggregates. In Proceedings of the 25th International Conference on Very Large Databases (VLDB '99). Edinburgh, U. K. 42-53.
44. SARAWAGI, S., AGRAWAL, R., AND MEGIDDO, N. 1998. Discovery-driven exploration of OLAP data cubes. In Proceedings of the 6th International Conference of Extending Database Technology (EDBT '98). Valencia, Spain. 168-182.
45. SHEN, Y. D., ZHANG, Z., AND YANG, Q. 2002. Objective-Oriented utility-based association mining. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM '02). Maebashi City, Japan. 426-433.
46. SILBERSCHATZ, A. AND TUZHILIN, A. 1995. On subjective measures of interestingness in knowledge discovery. In Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining (KDD-95). Montreal, Canada. 275-281.
47. SILBERSCHATZ, A. AND TUZHILIN, A. 1996. What makes patterns interesting in knowledge discovery systems. IEEE Trans. Knowl. Data Eng. 8, 6, 970-974.
48. TAN, P. AND KUMAR, V. 2000. Interestingness measures for association patterns: A perspective. Tech. Rep. 00-036, Department of Computer Science, University of Minnesota.
49. TAN, P., KUMAR, V., AND SRIVASTAVA, J. 2002. Selecting the right interestingness measure for association patterns. In Proceedings of the 8th International Conference on Knowledge Discovery and Data Mining (KDD 2002). Edmonton, Canada. 32-41.
50. VAILLANT, B., LENCA, P., AND LALLICH, S. 2004. A clustering of interestingness measures. In Proceedings of the 7th International Conference on Discovery Science (DS 2004). Padova, Italy. 290-297.
51. VITANYI, P. M. B. AND Li, M. 2000. Minimum description length induction, Bayesianism, and Kolmogorov complexity. IEEE Trans. Inf. Theory 46, 2, 446-464.
52. WANG, K., ZHOU, S., AND HAN, J. 2002. Profit mining: From patterns to actions. In Proceedings of the 8th Conference on Extending Database Technology (EDBT 2002). Prague, Czech Republic. 70-87.
53. WEBB, G. I. AND BRAIN, D. 2002. Generality is predictive of prediction accuracy. In Proceedings of the 2002 Pacific Rim Knowledge Acquisition Workshop (PKAW 2002). Tokyo. 117-180.
54. YAO, Y. Y., CHEN, Y. H., AND YANG, X. D. 2006. A measurement-theoretic foundation of rule interestingness evaluation. In Foundations and Novel Approaches in Data Mining, T. Y. Lin et al., Eds. Springer-Verlag, Berlin, 41-59.
55. YAO, Y.Y. AND ZHONG, N. 1999. An analysis of quantitative measures associated with rules. In Proceedings of the 3rd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-99). Beijing, China. 479-488.
56. YAO, H., HAMILTON, H. J., AND BUTZ, C. J. 2004. A foundational approach for mining itemset utilities from databases. In Proceedings of the SIAM International Conference on Data Mining. Orlando, FL. 482-486.
57. YAO, H. AND HAMILTON, H. J. 2006. Mining itemset utilities from transaction databases. Data Knowl. Eng. 59, 3.
58. ZBIDI, N., FAIZ, S., AND LIMAM, M. 2006. On mining summaries by objective measures of interestingness. Mach. Learn. 62, 3, 175-198.
59. ZHANG, H., PADMANABHAN, B., AND TUZHILIN, A. 2004. On the discovery of significant statistical quantitative rules. In Proceedings of the 10th International Conference on Knowledge Discovery and Data Mining (KDD 2004). Seattle, WA. 374-383.
60. ZHONG, N., YAO, Y. Y., AND OHSHIMA, M. 2003. Peculiarity oriented multidatabase mining. IEEE Trans. Knowl. Data Engi. 15, 4, 952-960.