30 October 2009 Spectral clustering with eigenvector selection based on ensemble ranking
Author Affiliations +
Proceedings Volume 7496, MIPPR 2009: Pattern Recognition and Computer Vision; 74960A (2009) https://doi.org/10.1117/12.832647
Event: Sixth International Symposium on Multispectral Image Processing and Pattern Recognition, 2009, Yichang, China
Abstract
Ng-Jordan-Weiss (NJW) method is one of the most widely used spectral clustering algorithms. For a clustering problem with K clusters, this method clusters data using the largest K eigenvectors of the normalized affinity matrix derived from the data set. However, the top K eigenvectors are not always the most important eigenvectors for clustering. In this paper, we propose an eigenvector selection method based on an ensemble of multiple eigenvector rankings (ESEER) for spectral clustering. In ESEER method, first multiple rankings of eigenvectors are obtained by using the entropy metric, which is used to measure the importance of each eigenvector, next the multiple eigenvector rankings are aggregated into a single consensus one, then the first K eigenvectors in the consensus ranking list are adopted as the selected eigenvectors. We have performed experiments on artificial data sets, standard data sets of UCI repository and handwritten digits from MNIST database. The experimental results show that ESEER method is more effective than NJW method in some cases.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Feng Zhao, Feng Zhao, Licheng Jiao, Licheng Jiao, Hanqiang Liu, Hanqiang Liu, } "Spectral clustering with eigenvector selection based on ensemble ranking", Proc. SPIE 7496, MIPPR 2009: Pattern Recognition and Computer Vision, 74960A (30 October 2009); doi: 10.1117/12.832647; https://doi.org/10.1117/12.832647
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT


Back to Top