2000 character limit reached
A Note on Spectral Clustering and SVD of Graph Data (1809.11029v1)
Published 27 Sep 2018 in cs.SI and cs.LG
Abstract: 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
