On a 'Two Truths' Phenomenon in Spectral Graph Clustering

23 Aug 2018Carey E. PriebeYoungser ParkJoshua T. VogelsteinJohn M. ConroyVince LyzinskiMinh TangAvanti AthreyaJoshua CapeEric Bridgeford

Clustering is concerned with coherently grouping observations without any explicit concept of true groupings. Spectral graph clustering - clustering the vertices of a graph based on their spectral embedding - is commonly approached via K-means (or, more generally, Gaussian mixture model) clustering composed with either Laplacian or Adjacency spectral embedding (LSE or ASE)... (read more)

PDF Abstract


No code implementations yet. Submit your code now

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet