Sciweavers

Share
IJCNN
2006
IEEE

Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm

10 years 5 months ago
Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been proposed that an information theoretic measure may be used as a cost function for clustering in a kernel space, approximated by the spectral properties of the Laplacian matrix. In this paper we extend this result to other kernel matrices. We develop an algorithm for the actual clustering which is based on comparing angles between data points, and demonstrate that the proposed method performs equally good as a state-of-the art spectral clustering method. We point out some drawbacks of spectral clustering related to outliers, and suggest measures to be taken.
Robert Jenssen, Deniz Erdogmus, Jose C. Principe
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where IJCNN
Authors Robert Jenssen, Deniz Erdogmus, Jose C. Principe
Comments (0)
books