Spectral Embedded Clustering
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1181-1185.
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 real-world data sets show that SEC significantly outperforms the existing spectral clustering methods as well as K-means clustering related methods.Feiping Nie, Dong Xu, Ivor Wai-Hung Tsang, Changshui Zhang
@inproceedings{ijcai2009p199,
title = {Spectral Embedded Clustering},
author = {Nie, Feiping and Xu, Dong and Tsang, Ivor W. and Zhang, Changshui},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {1181--1185},
year = {2009},
url = {https://ijcai.org/proceedings/2009/199},
}
TY - CPAPER TI - Spectral Embedded Clustering AU - Nie, Feiping AU - Xu, Dong AU - Tsang, Ivor W. AU - Zhang, Changshui T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 1181 EP - 1185 UR - https://ijcai.org/proceedings/2009/199 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: