Abstract
In this paper we focus on the issue of normalization of the affinity matrix in spectral clustering. We show that the difference between N-cuts and Ratio-cuts is in the error measure being used (relative-entropy versus L1 norm) in finding the closest doubly-stochastic matrix to the input affinity matrix. We then develop a scheme for finding the optimal, under Frobenius norm, doubly-stochastic approximation using Von-Neumann's successive projections lemma. The new normalization scheme is simple and efficient and provides superior clustering performance over many of the standardized tests.
Original language | English |
---|---|
Title of host publication | NIPS 2006 |
Subtitle of host publication | Proceedings of the 19th International Conference on Neural Information Processing Systems |
Editors | Bernhard Scholkopf, John C. Platt, Thomas Hofmann |
Publisher | MIT Press Journals |
Pages | 1569-1576 |
Number of pages | 8 |
ISBN (Electronic) | 0262195682, 9780262195683 |
State | Published - 2006 |
Event | 19th International Conference on Neural Information Processing Systems, NIPS 2006 - Vancouver, Canada Duration: 4 Dec 2006 → 7 Dec 2006 |
Publication series
Name | NIPS 2006: Proceedings of the 19th International Conference on Neural Information Processing Systems |
---|
Conference
Conference | 19th International Conference on Neural Information Processing Systems, NIPS 2006 |
---|---|
Country/Territory | Canada |
City | Vancouver |
Period | 4/12/06 → 7/12/06 |
Bibliographical note
Publisher Copyright:© NIPS 2006.All rights reserved