Understanding Regularized Spectral Clustering via Graph Conductance

• https://proceedings.neurips.cc/paper_files/paper/2018/file/2a845d4d23b883acb632fefd814e175f-Paper.pdf
• Yilin Zhang, Karl Rohe

Eigenvector localization in Spectral clustering. By adding small weight edges to every pair of nodes, we can regularize the graph and avoid the localization.

Also see Principal component analysis