2001 OnSpectralClustering

• (Ng, Jordan & Weiss, 2001) ⇒ Andrew Y. Ng, Michael I. Jordan, and Yair Weiss. (2001). “On Spectral Clustering: Analysis and an Algorithm.” In: Advances in Neural Information Processing Systems, 14 (NIPS 2001)

Subject Headings: Spectral Clustering Algorithm, Affinity Matrix.

Cited By

• ~4,096 http://scholar.google.com/scholar?q=%22On+Spectral+Clustering%3A+Analysis+and+an+algorithm%22

Quotes

Abstract

Despite many empirical successes of spectral clustering methods - algorithms that cluster points using eigenvectors of matrices derived from the data - there are several unresolved issues. First, there are 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.

---

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2001 OnSpectralClustering	Yair Weiss Andrew Y. Ng Michael I. Jordan			On Spectral Clustering: Analysis and an Algorithm		Advances in Neural Information Processing Systems, 14	http://ai.stanford.edu/~ang/papers/nips01-spectral.pdf			2001