Spectral Clustering of Graphs with the Bethe Hessian

@inproceedings{Saade2014SpectralCO,
  title={Spectral Clustering of Graphs with the Bethe Hessian},
  author={Alaa Saade and Florent Krzakala and Lenka Zdeborov{\'a}},
  booktitle={NIPS},
  year={2014}
}
Spectral clustering is a standard approach to label nodes on a graph by studying the (largest or lowest) eigenvalues of a symmetric real matrix such as e.g. the adjacency or the Laplacian. Recently, it has been argued that using instead a more complicated, non-symmetric and higher dimensional operator, related to the non-backtracking walk on the graph, leads to improved performance in detecting clusters, and even to optimal performance for the stochastic block model. Here, we propose to use… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

3 Figures & Tables

Topics

Statistics

01020201620172018
Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.