DMCA
On Spectral Clustering: Analysis and an algorithm (2001)
| Venue: | ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS |
| Citations: | 1705 - 13 self |
BibTeX
@INPROCEEDINGS{Ng01onspectral,
author = {Andrew Y. Ng and Michael I. Jordan and Yair Weiss},
title = {On Spectral Clustering: Analysis and an algorithm},
booktitle = {ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS },
year = {2001},
pages = {849--856},
publisher = {MIT Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Despite many empirical successes of spectral clustering methods -- algorithms that cluster points using eigenvectors of matrices derived from the distances between the points -- there are several unresolved issues. First, there is a wide variety of algorithms that use the eigenvectors in slightly different ways. Second, many of these algorithms have no proof that they will actually compute a reasonable clustering. In this paper, we present a simple spectral clustering algorithm that can be implemented using a few lines of Matlab. Using tools from matrix perturbation theory, we analyze the algorithm, and give conditions under which it can be expected to do well. We also show surprisingly good experimental results on a number of challenging clustering problems.
