Exploring interestingness through clustering: A framework

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2002, Pages 677-680

  Sahar, Sigal ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23044449842     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. Agrawal, M. Heikki, R. Srikant, H. Toivonen, and A. I. Verkamo. Advances in KD and DM, chapter 12, pgs 307-328. 1996.
2. C. Blake and C. Merz. UCI repository of machine learning databases. 1998. http://www.ics.uci.edu/~mlearn/mlrepository.html.
3. G. Dong and J. Li. Interestingness of discovered association rules in terms of neighborhood-based unexpectedness. PAKDD. pgs 72-86, 1998.
4. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, 1973.
5. P. Gago and C. Bento. A metric for selection of the most promising rules. PKDD, pgs 19-27, 1998.
6. J. Han. Mining knowledge at multiple concept levels. CIKM, pgs 19-24, 1995.
7. J. Han and M. Kamber. Data Mining Concepts and Techniques, chapter 8: Cluster Analysis, pgs 335-393, 2001.
8. J. A. Hanigan. Clustering Algorithms. John Wiley & Sons, 99th edition, 1975.
9. R. Hilderman and H. Hamilton. Principles for mining summaries using objective measures of interestingness. ICTAI, pgs 72-81. 2000,
10. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31(3):264-323, 1999.
11. G. Karypis, E.-H. Han. and V. Kumar. Chameleon: A hierarchical clustering algorithm using dynamic modeling. IEEE Computer: Special Issue on Data Analysis and Mining, 32(8):68-75, 1999.
12. B. Lent, A. N. Swami, and J. Widom. Clustering association rules. ICDE, pgs 220-231, 1997.
13. B. Liu, M. Hu, and W. Hsu. Multi-level organization and summarization of discovered rules. SIGKDD, pgs 208-217, 2000.
14. R. J. Miller and Y. Yang. Association rules over interval data. SIGMOD, pgs 452-461, 1997.
15. S. Sahar. Interestingness via what is not interesting. SIGKDD, pgs 332-336, 1999.
16. S. Sahar. Interestingness preprocessing. ICDM, pgs 489-196, 2001.
17. M. Spiliopoulou and J. F. Roddick. Higher order mining: Modeling and mining the results of knowledge discovery. DM-II, pgs 309-320, 2000.
18. H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hätönen, and H. Mannila. Pruning and grouping discovered association rules. ECML Workshop on Statistics, Machine Learning and KDD, pgs 47-52, 1995.