Subjectively interesting alternative clusters

CEUR Workshop Proceedings

Volumn 772, Issue , 2011, Pages 43-54

  De Bie, Tijl ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Alternative clustering; Subjective interestingness

Indexed keywords

CLUSTERING ALGORITHMS; OPTIMIZATION; REDUNDANCY;

ALTERNATIVE CLUSTERING; APPROXIMATION TECHNIQUES; ARTIFICIAL DATASETS; CLUSTERING APPROACH; INTERESTINGNESS; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; SPECTRAL CLUSTERING ALGORITHMS;

ITERATIVE METHODS;

EID: 84891128433     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. T. De Bie and N. Cristianini. Fast sdp relaxations of graph cut clustering, transduction, and other combinatorial problems. Journal of Machine Learning Research, 7:1409-1436, 2006.
2. T. De Bie. Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Mining and Knowledge Discovery, 2010.
3. T. De Bie. An information-theoretic framework for data mining. In Proc. of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD11), 2011.
4. T. De Bie, K.-N. Kontonasios, and E. Spyropoulou. A framework for mining interesting pattern sets. SIGKDD Explorations, 2010.
5. K.-N. Kontonasios and T. De Bie. An information-theoretic approach to finding informative noisy tiles in binary databases. In Proceedings of the 2010 SIAM International Conference on Data Mining, 2010.
6. Jiming Peng and Yu Wei. Approximating k-means-type clustering via semidefinite programming. SIAM Journal on Optimization, 18(1), 2007.
7. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
8. H. Zha, C. Ding, M. Gu, X. He, and H. Simon. Spectral relaxation for k-means clustering. In Advances in Neural Information Processing Systems 14 (NIPS01), pages 1057-1064, 2002.