Spectral embedded clustering

Publication Type:
Conference Proceeding
Citation:
IJCAI International Joint Conference on Artificial Intelligence, 2009, pp. 1181 - 1186
Issue Date:
2009-12-01
Full metadata record
Files in This Item:
Filename Description Size
2013004336OK.pdf Published version813.09 kB
Adobe PDF
In this paper, we propose a new spectral clustering method, referred to as Spectral Embedded Clustering (SEC), to minimize the normalized cut criterion in spectral clustering as well as control the mismatch between the cluster assignment matrix and the low dimensional embedded representation of the data. SEC is based on the observation that the cluster assignment matrix of high dimensional data can be represented by a low dimensional linear mapping of data. We also discover the connection between SEC and other clustering methods, such as spectral clustering, Clustering with local and global regularization, K-means and Discriminative K-means. The experiments on many realworld data sets show that SEC significantly outperforms the existing spectral clustering methods as well as K-means clustering related methods.
Please use this identifier to cite or link to this item: