A survey of interestingness measures for knowledge discovery

Knowledge Engineering Review

Volumn 20, Issue 1, 2005, Pages 39-61

  McGarry, Ken ^a  

^a UNIVERSITY OF SUNDERLAND   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE ACQUISITION; STATISTICAL METHODS; WAVE FILTERS;

DATA MINER; STATISTICAL STRENGTHS;

DATA MINING;

EID: 28544452631     PISSN: 02698889     EISSN: 14698005     Source Type: Journal    
DOI: 10.1017/S0269888905000408     Document Type: Article

References (92)

1. Agrawal, R, Imielinski, T and Swami, A, 1993, Mining association rules between sets of items in large databases. In SIGMOD-93, pp. 207-216.
2. Agrawal, R, Mannila, H, Srikant, R, Toivonen, H and Verkamo, A, 1996, Fast discovery of association rules. In Fayyad, U., Piatetsky-Shapiro, G., Smyth, P and Uthursamy, R. (eds.), Advances in Knowledge Discovery and Data Mining. AAAI Press.
3. Agrawal, R and Srikant, R, 1995, Mining sequential patterns. In Proceedings of the International Conference on Data Engineering (ICDE), Taipei, Taiwan.
4. Anand, S., Patrick, A., Hughes, J and Bell, D, 1998, A, datamining methodology for cross-sales. Knowledge-based Systems 10, 449-461.
5. Atkinson, A, 1970, On the measurement of inequality. Journal of Economic Theory 2, 244-263.
6. Bayardo, R. and Agrawal, R, 1999, Mining the most interesting rules. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, pp. 145-154.
7. Berger, G and Tuzhilin, A, 1998, Discovering unexpected patterns in temporal data using temporal logic. In Etzon, O, Jajodia, S and Sripada. S (eds.). Temporal Databases Research and Practice (Lecture Notes in Computer Science, 1399), pp. 281-309.
8. Brachman, R, 1993, Integrated support for data archaeology. International Journal of Intelligent and Cooperative Information Systems 2(2), 159-185.
9. Brijs, T., Vanhoof, K and Wets, G, 2003, Defining interestingness for association rules. International Journal of Information Theories and Applications 10(4), 370-376.
10. Brin, S, Motwani, R and Silverstein, C, 1997a, Beyond market baskets: generalizing association rules to correlations. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 265-276.
11. Brin, S, Motwani, R, Ullman, J and Tsur, S, 1997b, Dynamic itemset counting and implication rules for market basket data. In J Peckham, SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, Tucson, AZ, pp. 255-264.
12. Buntine, W, 1996, Graphical models for discovering knowledge. In Fayyad, U, Piatetsky-Shapiro, G, Smyth, P and Uthursamy, R (eds.), Advances in Knowledge Discovery and Data Mining. AAAI Press, pp. 59-82.
13. Chen, M, Han, J and Yu, P, 1996, Data mining: an overview from a database perspective. IEEE Transactions on Knowledge and Data Engineering 8(6), 866-883.
14. Coenen, F and Leng, P, 2001, Optimising association rule algorithms using itemset ordering. In Proceedings of the 21st Annual International Conference of the British Computer Society Specialist Group on Expert Systems. Cambridge: Springer, pp. 53-66.
15. Colton, S and Bundy, A, 2000, On the notion of interestingness in automated mathematical discovery. International Journal of Human-Computer Studies 53, 351-375.
16. Correia, J, Stumme, G, Wille, R. &Wille, U, 2003, Conceptual knowledge discovery - a human centered approach. Applied Artificial Intelligence 17(3), 281-302.
17. DiFore, F, 2000, Visualizing interestingness. In Proceedings of the 3rd International Conference on Data Mining, pp. 147-156.
18. Dykes, J and Mountain, D, 2003, Seeking structure in records of spatio-temporal behaviour: visualization issues, efforts and applications. Computational Statistics and Data Analysis 43, 581-603.
19. Fabris, C and Freitas, A, 1999, Discovering surprising patterns by detecting occurrences of simpson's paradox. In Development in Intelligent Systems XVI (Proc. Expert Systems 99, The 19th SGES International Conference on Knowledge-based Systems and Applied Artificial Intelligence), Cambridge, UK, pp. 148-160.
20. Fayyad, U, Piatetsky-Shapiro, G and Smyth, P, 1996a, From data mining to knowledge discovery: an overview. In Fayyad, U, Piatetsky-Shapiro, G, Smyth, P and Uthursamy, R (eds.). Advances in Knowledge Discovery and Data Mining. AAAI Press, pp. 1-34.
21. Fayyad, U, Piatetsky-Shapiro, G, Smyth, P and Uthursamy, R (eds.) 1996b, Knowledge Discovery in Databases. AAAI Press/MIT Press.
22. Fayyad, U and Stolorz, P, 1997, Data mining and KDD: promise and challenges. Future Generation Computer Systems 13(2-3), 99-115.
23. Frawley, WJ, Piatetsky-Shapiro, G and Maltheus, CJ, 1991, Knowledge Discovery in Databases: An Overview. AAAI Press/MIT Press.
24. Freitas, A, 1998, On objective measures of rule surprisingness. In Principles of Data Mining and Knowledge Discovery: Proceedings of the 2nd European Symposium, Nantes, France (Lecture Notes in Artificial Intelligence, 1510), pp. 1-9.
25. Freitas, A, 1999, On rule interestingness measures. Knowledge-based Systems 12(5-6), 309-315.
26. Gago, P and Bento, C, A metric for selection of the most promising rules. In Proceedings of the 2nd European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD-98), Nantes, France, pp. 19-27.
27. Games, B, 1996, Transforming rules and trees. In Fayyad, U, Piatetsky-Shapiro, G, Smyth, P and Uthursamy, R (eds.). Advances in Knowledge Discovery and Data Mining. AAAI Press, pp. 205-226.
28. Glymour, C, Madigan, D, Pregibon, D and Smyth, P, 1997, Statistical themes and lessons for data mining. Data Mining and Knowledge Discovery 1(1), 11-28.
29. Gray, B and Orlowska, M, 1998, CCAIIA: clustering categorical attributes into interesting association rules. In Proceedings of the 2nd Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 132-143.
30. Han, J, Cai, Y and Cereone, N, 1993, Data driven discovery of quantitative rules in relational databases. IEEE Transactions on Knowledge and Data Engineering 5(1), 29-40.
31. Hand, D, 1999, Statistics and data mining; intersecting disciplines. ACM SIGKDD Explorations 1(1), 16-19.
32. Hand, D, Mannila, H and Smyth, P, 2001, Principles of Data Mining. MIT Press.
33. Hilario, M and Kalousis, A, 2000, Building algorithm profiles for prior model selection in knowledge discovery systems. Engineering Intelligent Systems 8(2), 77-87.
34. Hilderman, R and Hamilton, H, 1999, Heuristic measures of interestingness. In Proceedings of the 3rd European Symposium on Principles of Data Mining and Knowledge Discovery (PKDD'99), Prague, Czech Republic (Lecture Notes in Computer Science), pp. 232-241.
35. Hilderman, R and Hamilton, H, 2001, Knowledge Discovery and Measures of Interest. Kluwer Academic Publishers.
36. Hilderman, R and Hamilton, H, 2003, Measuring the interestingness of discovered knowledge: a principled approach. Intelligent Data Analysis 7(4), 347-382.
37. Hipp, J, Guntzer, U and Nakhaeizadeh, G, 2000, Algorithms for association rule mining - a general comparison. SIGKDD Explorations 2, 58-64.
38. Hussain, F, Liu, H, Suzuki, E and Lu, H, 2000, Exception rule mining with a relative interestingness measure. In Proceedings of the 4th Pacific-Asia Conference an Knowledge Discovery and Data Mining, pp. 86-97.
39. Ikizler, N and Gvenir, HA, 2001, Mining interesting rules in bank loans data. In Acan, A, Aybay, I and Salamah, M (eds.), Proceedings of the 10th Turkish Symposium on Artificial Intelligence and Neural Networks (TAINN 2001), pp. 238-246.
40. Inokuchi, A, Washio, T and Motoda, H, 2003, Complete mining of frequent patterns from graphs: mining graph data. Machine Learning 50, 321-354.
41. Jaroszewicz, S and Simovici, DA, 2004, Interestingness of frequent itemsets using Bayesian networks as background knowledge. In Proceedings of the 2004, ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, WA, pp. 178-186.
42. Kamber, M and Shinghal, R, 1996, Evaluating the interestingness of characteristic rules. In Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining, pp. 263-266.
43. Klemettimen, M, Mannila, H, Ronkainen, P, Toivonen, H and Verkamo, A, 1994, Finding interesting rules from large sets of discovered association rules. In Adam, N, Bhargava, B and Yesha, Y (eds.). Proceedings of the 3rd International Conference on Information and Knowledge Management (CIKM'94). ACM Press, pp. 401-407.
44. Klösgen, W, 1995, Efficient discovery of interesting statements in databases. Journal of Intelligent Information Systems 4, 53-69.
45. Korn, F, Labrinidis, A, Kotidis, Y and Faloutsos, C, 2000, Quantifiable data mining using ratio rules. The VLDB Journal 8. 254-266.
46. Kulkarni, D and Simon, H, 1988, The process of scientific discovery: the strategy of experimentation. Cognitive Science 12, 139-175.
47. Kullback, S and Leiber, R, 1951, On information and sufficiency. Ann. Math. Stat. 4, 99-111.
48. Langely, P, Zytkow, J, Simon, HA and Bradshaw, GL, 1983, The search for regularity: four aspects of scientific discovery. In Michalski, RS and Carbonell, J (eds.). Machine Learning: an AI Approach. Tioga Publishing Company.
49. Lavington, S, Dewhirst, N and Freitas, A, 1999, Interfacing knowledge discovery algorithms to large database management systems. Information and Software Technology 41, 605-617.
50. Lenat, D, 1983, The role of heuristics in learning by discovery: three case studies. In Michalski, RS and Carbonell, J (eds.), Machine Learning: an AI Approach. Tioga Publishing Company.
51. Lenat, D and Brown, J, 1984, Why AM and Eurisko appear to work. Artificial Intelligence 23, 269-294.
52. Liu, B, Hsu, W, Chen, S and Ma, Y, 2000, Analyzing the subjective interestingness of association rules. IEEE Intelligent Systems 15(5), 47-55.
53. Liu, B, Hsu, W, Mun, L and Lee, HY, 1999, Finding interesting patterns using user expectations. IEEE Transactions on Knowledge and Data Engineering 11(6), 817-832.
54. Liu, B, Ma, Y and Wong. C, 2003, Scoring the data using association rules. Applied Intelligence 18, 119-135.
55. Livingstone, G, Rosenberg, J and Buchanan, B, 2003, An agenda and justification based framework for discovery systems. Knowledge and Information Systems 5(2), 133-161.
56. Lorenz, M, 1905, Methods of measuring the concentration of wealth. Quart. Publ. American Statist. Assoc. 9, 209-219.
57. Ludwig, J and Livingstone, G, 2000, What's new? Using prior models as a measure of novelty in knowledge discovery. In Proceedings of the 12th IEEE Conference on Tools with Artificial Intelligence, pp. 86-89.
58. Major, J and Mangano, J, 1995, Selecting among rules induced from a hurricane database. Journal of Intelligent Information Systems 4(1), 39-52.
59. Malone, J, McGarry, K and Bowerman, C, 2004, Performing trend analysis on spatio-temporal proteomics data using differential ratio rules. In Proceedings of the 6th EPSRC Conference on Postgraduate Research in Electronics, Photonics, Communications and Software, University of Hertfordshire, UK, pp. 103-105.
60. Matheus, C, Chan, P and Piatetsky-Shapiro, G, 1993, Systems for knowledge discovery in databases. IEEE Transactions on Knowledge and Data Engineering 5(6), 903-913.
61. McGarry, K and Malone, J, 2004, Analysis of rules discovered by the data mining process. In Lofti, A and Garibaldi, J (eds.), Applications and Science in Soft Computing Series: Advances in Soft Computing. Springer, pp. 219-224.
62. McGarry, K, Wermter, S and Maclntyre, J, 2001a, The extraction and comparison of knowledge from local function networks. International Journal of Computational Intelligence and Applications 1(4), 369-382.
63. McGarry, K, Wermter, S and MacIntyre, J, 2001 b, Knowledge extraction from local function networks. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, 2, Seattle, W A, pp. 765-770.
64. Merzbacher, M, 2002, Automatic Generation of Trivia Questions (Lecture Notes in Computer Science, 2366), pp. 123-130.
65. Mielikainen, T, 2003, Finding all occurring sets of interest. In Boulicaut, J and Dzeroski, S (eds.), Proceedings of the 2nd International Workshop on Knowledge Discovery in Inductive Databases, pp. 97-106.
66. 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, pp. 94-100.
67. Padmanabhan, B and Tuzhilin, A, 1999, Unexpectedness as a measure of interestingness in knowledge discovery. Decision Support Systems 27, 303-318.
68. Padmanabhan, B and Tuzhilin, A, 2002, Knowledge refinement based on the discovery of unexpected patterns in data mining Decision Support Systems 33, 309-321.
69. Pazzani, M, 2000, Knowledge discovery from data? IEEE Intelligent Systems 15(2), 10-13.
70. Pearl, J, 2000, Causality. Cambridge: Cambridge University Press.
71. Piatetsky-Shapiro, G and Frawley, WJ (eds.) 1991, Knowledge Discovery in Databases. AAAI Press/MIT Press.
72. Piatetsky-Shapiro, G and Matheus, CJ, 1994, The interestingness of deviations. In Proceedings of AAAI Workshop on Knowledge Discovery in Databases.
73. Quinlan, J. R, 1992 C4.5: Programs for Machine Learning. San Francisco: Kaufmann.
74. Ramaswamy, S, Mahajan, S and Silberschatz, A, 1998, On the discovery of interesting patterns in association rules. In Proceedings of the 24th International Conference on Very Large Data Bases. San Francisco: Kaufmann, pp. 368-379.
75. Roddick, J and Rice, S, 2001, What's interesting about cricket? - On thresholds and anticipation in discovered rules. SIGKDD Explorations 3(1), 1-5.
76. Roddick, I and Spilioppoulou, M, 2001a, A survey of temporal knowledge discovery paradigms and methods. IEEE Transactions on Knowledge and Data Engineering 14(4), 750-767.
77. Romao, W, Freitas, A and Gimenes, I, 2004, Discovering interesting knowledge from a science and technology database with a genetic algorithm. Applied Soft Computing 4(2), 121-137.
78. Roussinov, D and Zhao, J, 2003, Automatic discovery of similarity relationships through web mining. Decision Support Systems 35, 149-166.
79. Sahar, S, 1999, Interestingness via what is not interesting. In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining, San Diego, CA, pp. 332-336.
80. Sahar, S, 2001, Interestingness preprocessing. In Proceedings of the 2001, IEEE International Conference on Data Mining, San Jose, CA, pp. 489-496.
81. Sahar, S, 2002, On incorporating subjective interestingness into the mining process. In Proceedings of the 2002, IEEE International Conference on Data Mining (ICDM 2002), Maebashi City, Japan, pp. 681-684.
82. Shannon, C, 1948, A mathematical theory of communication. The Bell System Technical Journal 27, 379-423.
83. 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, pp. 275-281.
84. Silberschatz, A and Tuzhilin, A, 1996a, User-assisted knowledge discovery: how much should the user be involved. In ACM-SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery.
85. Silberschatz, A and Tuzhilin, A, 1996b, What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering 8(6), 970-974.
86. Smyth, P and Goodman, R, 1992, An information theoretic approach to rule induction from databases. IEEE Transactions on Knowledge and Data Engineering 4(4), 301-316.
87. St Amant, R and Cohen, P, 1998, Intelligent support for exploratory data analysis. Journal of Computational and Graphical Statistics 7(4), 545-558.
88. Tan, P, Kumar, V and Srivastava, J, 2002, Selecting the right interestingness measure for association patterns. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, pp. 32-41.
89. Wang, K, Tay, S and Liu, B, 1998, Interestingness-based interval merger for numeric association rules. In Agrawal, R, Stolorz, PE and Piatetsky-Shapiro, G (eds.), Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, KDD. AAAI Press, pp. 121-128.
90. Zhong, N, Liu, C and Ohsuga, S, 2001, Dynamically organizing KDD processes. International Journal of Pattern Recognition and Artificial Intelligence 15(3), 451-473.
91. Zhong, N and Yao, Y, 2003, Peculiarity oriented multidatabase mining. IEE Transactions on Knowledge and Data Engineering 15(4), 952-960.
92. Zytkow, J, 1993, Introduction: cognitive autonomy in machine learning. Machine Learning 12, 7-16.