Spectral Kernel Methods for Clustering

In this paper we introduce new algorithms for unsupervised learn(cid: 173) ing based on the use of a kernel matrix. All the information re(cid: 173) quired by such algorithms is contained in the eigenvectors of the matrix or of closely related matrices. We use two different but re(cid: 173) lated cost functions, the Alignment and the 'cut cost'. The first one is discussed in a companion paper [3], the second one is based on graph theoretic concepts. Both functions measure the level of clustering of a labeled dataset, or the correlation between data clus(cid: 173) ters and labels. We state the problem of unsupervised learning as assigning labels so as to optimize these cost functions. We show how the optimal solution can be approximated by slightly relaxing the corresponding optimization problem, and how this corresponds to using eigenvector information. The resulting simple algorithms are tested on real world data with positive results.

Authors

• Nello Cristianini
• John Shawe-Taylor University College London
• Jaz Kandola

Keywords

No keywords are indexed for this paper.