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.
@article{arxiv.1809.11029,
title = {A Note on Spectral Clustering and SVD of Graph Data},
author = {Ziwei Zhang},
journal= {arXiv preprint arXiv:1809.11029},
year = {2018}
}