fundamental weakness
our main claim that spectral modification can circumvent a fundamental weakness of spectral clustering
We thank the reviewers for their nice and helpful comments. Our modification algorithm is intended as a proof of concept of what we view as a general framework. There have been several recent works on graph embedding methods. Our experimental examples are well known and appreciated in spectral graph theory. We can report that the unsupervised versions of recent graph embedding methods (e.g.