Evaluation of interestingness measures for ranking discovered knowledge

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2035, Issue , 2001, Pages 247-259

  Hilderman, Robert J ^a   Hamilton, Howard J ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

DIVERSITY MEASURE; HUMAN USERS; INDEX VALUES; INTERESTINGNESS; INTERESTINGNESS MEASURES; LARGE DATABASE; SYNTHETIC DATA; TAXONOMIC HIERARCHY;

DATA MINING;

EID: 84942847271     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45357-1_28     Document Type: Conference Paper

References (23)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Pro- ceedings of the 20th International Conference on Very Large Databases (VLDB'94), pages 487-499, Santiago, Chile, September 1994.
2. A.B. Atkinson. On the measurement of inequality. Journal of Economic Theory, 2:244-263, 1970.
3. R.J. Bayardo and R. Agrawal. Mining the most interesting rules. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining (KDD'99), pages 145-154, San Diego, California, August 1999.
4. I. Bournaud and J.-G. Ganascia. Accounting for domain knowledge in the construc- tion of a generalization space. In Proceedings of the Third International Conference on Conceptual Structures, pages 446-459. Springer-Verlag, August 1997.
5. C.L. Carter and H.J. Hamilton. Eficient attribute-oriented algorithms for knowl- edge discovery from large databases. IEEE Transactions on Knowledge and Data Engineering, 10(2):193-208, March/April 1998.
6. H. Dalton. The measurement of the inequality of incomes. Economic Journal, 30:348-361, 1920.
7. G. Dong and J. Li. Interestingness of discovered association rules in terms of neighborhood-based unexpectedness. In X. Wu, R. Kotagiri, and K. Korb, editors, Proceedings of the Second Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'98), pages 72-86, Melbourne, Australia, April 1998.
8. A.A. Freitas. On objective measures of rule surprisingness. In J. Zytkow and M. Quafafou, editors, Proceedings of the Second European Conference on the Prin- ciples of Data Mining and Knowledge Discovery (PKDD'98), pages 1-9, Nantes, France, September 1998.
9. R. Godin, R. Missaoui, and H. Alaoui. Incremental concept formation algorithms based on galois (concept) lattices. Computational Intelligence, 11(2):246-267, 1995.
10. R.J. Hilderman and H.J. Hamilton. Heuristic measures of interestingness. In J. Zytkow and J. Rauch, editors, Proceedings of the Third European Conference on the Principles of Data Mining and Knowledge Discovery (PKDD'99), pages 232-241, Prague, Czech Republic, September 1999.
11. R.J. Hilderman and H.J. Hamilton. Heuristics for ranking the interestingness of discovered knowledge. In N. Zhong and L. Zhou, editors, Proceedings of the Third Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'99), pages 204-209, Beijing, China, April 1999.
12. R.J. Hilderman and H.J. Hamilton. Applying objective interestingness measures in data mining systems. In Proceedings of the 4th European Symposium on Princi- ples of Data Mining and Knowledge Discovery (PKDD'00), pages 432-439, Lyon, France, September 2000.
13. R.J. Hilderman and H.J. Hamilton. Principles for mining summaries: Theorems and proofs. Technical Report CS 00-01, Department of Computer Science, Univer- sity of Regina, February 2000. Online at http://www.cs.uregina.ca/research/Techreport/0001.ps.
14. R.J. Hilderman and H.J. Hamilton. Principles for mining summaries using objec- tive measures of interestingness. In Proceedings of the Twelfth IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00), pages 72-81, Vancou- ver, Canada, November 2000.
15. R.J. Hilderman, H.J. Hamilton, and N. Cercone. Data mining in large databases using domain generalization graphs. Journal of Intelligent Information Systems, 13(3):195-234, November 1999.
16. S. Lieberson. An extension of Greenberg's linguistic diversity measures. Language, 40:526-531, 1964.
17. A.E. Magurran. Ecological diversity and its measurement. Princeton University Press, 1988.
18. B. Padmanabhan and A. Tuzhilin. A belief-driven method for discovering unex- pected patterns. In Proceedings of the Fourth International Conference on Knowl- edge Discovery and Data Mining (KDD'98), pages 94-100, New York, New York, August 1998.
19. G.P. Patil and C. Taillie. Diversity as a concept and its measurement. Journal of the American Statistical Association, 77(379):548-567, 1982.
20. S. Sahar. Interestingness via what is not interesting. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining (KDD'99), pages 332-336, San Diego, California, August 1999.
21. C.E. Shannon and W. Weaver. The mathematical theory of communication. Uni- versity of Illinois Press, 1949.
22. G. Stumme, R. Wille, and U. Wille. Conceptual knowledge discovery in databases using formal concept analysis methods. In J. Zytkow and M. Quafafou, editors, Proceedings of the Second European Conference on the Principles of Data Mining and Knowledge Discovery (PKDD'98), pages 450-458, Nantes, France, September 1998.
23. M.L.Weitzman. On diversity. The Quarterly Journal of Economics, pages 363-405, May 1992.