Spectral Embedded Clustering
By: Researcher II
Disclaimer: “The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).”
Please contact us in case of a broken link from here
| Authors | Feiping Nie, Dong Xu, Ivor W.Tsang, Changshui Zhang |
| Journal/Conference Name | The 21st International Joint Conference on Artificial Intelligence (IJCAI) |
| Paper Category | Computer Science |
| Paper Abstract | 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. |
| Date of publication | 2009 |
| Code Programming Language | MATLAB |
| Comment |
Copyright Researcher II 2022