@inproceedings{d69168735a23434b90720e92b752c533,
title = "On spectral clustering: Analysis and an algorithm",
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 110 proof that they will actually compute a reasonable clustering. T11 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 011 a number of challenging clustering problems.",
author = "Ng, {Andrew Y.} and Jordan, {Michael I.} and Yair Weiss",
year = "2002",
language = "American English",
isbn = "0262042088",
series = "Advances in Neural Information Processing Systems",
publisher = "Neural information processing systems foundation",
booktitle = "Advances in Neural Information Processing Systems 14 - Proceedings of the 2001 Conference, NIPS 2001",
note = "15th Annual Neural Information Processing Systems Conference, NIPS 2001 ; Conference date: 03-12-2001 Through 08-12-2001",
}