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