Abstract
Spectral clustering is an empirically successful approach to separating a dataset into some groups with possibly complex shapes based on pairwise affinity. Identifying the number of clusters automatically is still an open issue, although many heuristics have been proposed. In this paper, imposing sparsity on the eigenvectors of graph Laplacian is proposed to attain reasonable approximations of the so-called cluster-indicator-vectors, from which the clusters as well as the cluster number are identified. The proposed algorithm enjoys low computational complexity as it only computes a relevant subset of eigenvectors. It also enjoys better clustering quality than the existing methods, as shown by simulations using nine real datasets.
| Original language | English |
|---|---|
| Title of host publication | 2018 26th European Signal Processing Conference, EUSIPCO 2018 |
| Publisher | European Signal Processing Conference, EUSIPCO |
| Pages | 1187-1191 |
| Number of pages | 5 |
| Volume | 2018-September |
| ISBN (Electronic) | 9789082797015 |
| DOIs | |
| Publication status | Published - 2018 Nov 29 |
| Event | 26th European Signal Processing Conference, EUSIPCO 2018 - Rome, Italy Duration: 2018 Sep 3 → 2018 Sep 7 |
Other
| Other | 26th European Signal Processing Conference, EUSIPCO 2018 |
|---|---|
| Country | Italy |
| City | Rome |
| Period | 18/9/3 → 18/9/7 |
Fingerprint
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering
Cite this
Spectral clustering with automatic cluster-number identification via finding sparse eigenvectors. / Ogino, Yuto; Yukawa, Masahiro.
2018 26th European Signal Processing Conference, EUSIPCO 2018. Vol. 2018-September European Signal Processing Conference, EUSIPCO, 2018. p. 1187-1191 8553168.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Spectral clustering with automatic cluster-number identification via finding sparse eigenvectors
AU - Ogino, Yuto
AU - Yukawa, Masahiro
PY - 2018/11/29
Y1 - 2018/11/29
N2 - Spectral clustering is an empirically successful approach to separating a dataset into some groups with possibly complex shapes based on pairwise affinity. Identifying the number of clusters automatically is still an open issue, although many heuristics have been proposed. In this paper, imposing sparsity on the eigenvectors of graph Laplacian is proposed to attain reasonable approximations of the so-called cluster-indicator-vectors, from which the clusters as well as the cluster number are identified. The proposed algorithm enjoys low computational complexity as it only computes a relevant subset of eigenvectors. It also enjoys better clustering quality than the existing methods, as shown by simulations using nine real datasets.
AB - Spectral clustering is an empirically successful approach to separating a dataset into some groups with possibly complex shapes based on pairwise affinity. Identifying the number of clusters automatically is still an open issue, although many heuristics have been proposed. In this paper, imposing sparsity on the eigenvectors of graph Laplacian is proposed to attain reasonable approximations of the so-called cluster-indicator-vectors, from which the clusters as well as the cluster number are identified. The proposed algorithm enjoys low computational complexity as it only computes a relevant subset of eigenvectors. It also enjoys better clustering quality than the existing methods, as shown by simulations using nine real datasets.
UR - http://www.scopus.com/inward/record.url?scp=85059806403&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85059806403&partnerID=8YFLogxK
U2 - 10.23919/EUSIPCO.2018.8553168
DO - 10.23919/EUSIPCO.2018.8553168
M3 - Conference contribution
VL - 2018-September
SP - 1187
EP - 1191
BT - 2018 26th European Signal Processing Conference, EUSIPCO 2018
PB - European Signal Processing Conference, EUSIPCO
ER -