A Note on Spectral Clustering and SVD of Graph Data
2018-09-27Unverified0· sign in to hype
Ziwei Zhang
Unverified — Be the first to reproduce this paper.
ReproduceAbstract
Spectral clustering and Singular Value Decomposition (SVD) are both widely used technique for analyzing graph data. In this note, I will present their connections using simple linear algebra, aiming to provide some in-depth understanding for future research.