NeurIPS 2018poster126 citations
Understanding Regularized Spectral Clustering via Graph Conductance
Abstract
This paper uses the relationship between graph conductance and spectral clustering to study (i) the failures of spectral clustering and (ii) the benefits of regularization. The explanation is simple. Sparse and stochastic graphs create several
BibTeX
@inproceedings{NEURIPS2018_2a845d4d,
author = {Zhang, Yilin and Rohe, Karl},
booktitle = {Advances in Neural Information Processing Systems},
editor = {S. Bengio and H. Wallach and H. Larochelle and K. Grauman and N. Cesa-Bianchi and R. Garnett},
pages = {},
publisher = {Curran Associates, Inc.},
title = {Understanding Regularized Spectral Clustering via Graph Conductance},
url = {https://proceedings.neurips.cc/paper_files/paper/2018/file/2a845d4d23b883acb632fefd814e175f-Paper.pdf},
volume = {31},
year = {2018}
}