Spectral Modification of Graphs for Improved Spectral Clustering

1 code implementation • NeurIPS 2019 • Ioannis Koutis, Huong Le

Applying then spectral clustering on $H$ has the potential to produce improved cuts that also exist in $G$ due to the cut similarity.

Clustering graph partitioning