DMCA
Clustering by weighted cuts in directed graphs (2007)
Cached
Download Links
- [www.siam.org]
- [siam.org]
- [www.cs.washington.edu]
- [www.stat.washington.edu]
- [www.stat.washington.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 2007 SIAM International Conference on Data Mining |
| Citations: | 30 - 1 self |
BibTeX
@INPROCEEDINGS{Meilă07clusteringby,
author = {Marina Meilă and William Pentney},
title = {Clustering by weighted cuts in directed graphs},
booktitle = {In Proceedings of the 2007 SIAM International Conference on Data Mining},
year = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends several popular criteria like the normalized cut and the averaged cut to asymmetric affinity data. We show that this problem can be relaxed to a Rayleigh quotient problem for a symmetric matrix obtained from the original affinities and therefore a large body of the results and algorithms developed for spectral clustering of symmetric data immediately extends to asymmetric cuts. 1
