Share Email Print

Proceedings Paper

Spectral clustering with eigenvector selection based on ensemble ranking
Author(s): Feng Zhao; Licheng Jiao; Hanqiang Liu
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 30 October 2009
PDF: 7 pages
Proc. SPIE 7496, MIPPR 2009: Pattern Recognition and Computer Vision, 74960A (30 October 2009); doi: 10.1117/12.832647
Show Author Affiliations
Feng Zhao, Xidian Univ. (China)
Licheng Jiao, Xidian Univ. (China)
Hanqiang Liu, Xidian Univ. (China)

Published in SPIE Proceedings Vol. 7496:
MIPPR 2009: Pattern Recognition and Computer Vision
Mingyue Ding; Bir Bhanu; Friedrich M. Wahl; Jonathan Roberts, Editor(s)

© SPIE. Terms of Use
Back to Top