A Note on Spectral Clustering and SVD of Graph Data

2018/09/27 by Zhang, Ziwei
#FOS: Computer and information sciences #Machine Learning (cs.LG) #Social and Information Networks (cs.SI)

paper · doi:10.48550/arxiv.1809.11029

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.

Related

• flow-based clustering and spectral clustering: a comparison
• Spectral Graph Analysis: A Unified Explanation and Modern Perspectives
• Eigenvectors for clustering: Unipartite, bipartite, and directed graph cases
• An Improved and Generalised Analysis for Spectral Clustering
• Spectral Toolkit of Algorithms for Graphs: Technical Report (1)