Minimum entropy, κ-means, spectral clustering

IEEE International Conference on Neural Networks - Conference Proceedings

Volumn 1, Issue , 2004, Pages 117-122

  Lee, Yongjin ^a   Choi, Seungjin ^b  

^a Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; ENTROPY; MATRIX ALGEBRA; PROBABILITY DENSITY FUNCTION; VECTORS;

EIGEN-DECOMPOSITION METHOD; MINIMUM ENTROPY PRINCIPLE; SPECTRAL CLUSTERING;

INFORMATION THEORY;

EID: 10944243750     PISSN: 10987576     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. J. C. Principe, D. Xu, and J. W. Fisher III, "Information-theoretic learning," in Unsupervised Adaptive Filtering: Blind Source Separation, S. Haykin, Ed. John Wiley & Sons, Inc., 2000.
2. S. J. Roberts, R. Everson, and I. Rezek, "Maximum certainty data partitioning," Pattern Recognition, vol. 33, pp. 833-839, 2000.
3. S. J. Roberts, C. Holmes, and D. Denison, "Minimum entropy data partitioning using reversible jump Markov chain Monte Carlo," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 8, pp. 909-914, 2001.
4. V. Roth, J. Laub, M. Kawanabe, and J. M. Buhmann, "Optimal cluster preserving embedding of non-metric proximity data," University of Bonn, Tech. Rep. IAI-TR-2002-5, 2002.
5. J. Shi and J. Malik, "Normalized cuts and image segmentation," in Proc. IEEE Conf. Computer Vision and Pattern Recognition, 1997, pp. 731-737.
6. K. Torkkola and W. M. Campbell, "Mutual information in learning feature transformations," in Proc. Int. Conf. Machine Learning, 2000, pp. 1015-1022.