Fetching the paper…

Reading the bibliography…

A Note on Spectral Clustering and SVD of Graph Data · Around

2018

A Note on Spectral Clustering and SVD of Graph Data

Zhang, Ziwei

Original
PDF
Post on X

Understand

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.

Built on

The approximation of one matrix by another of lower rank
Carl Eckart and Gale Young · 1936
Earlier work this paper cites.
Spectral graph theory
Fan RK Chung and Fan Chung Graham · 1997
Earlier work this paper cites.
Normalized cuts and image segmentation
Jianbo Shi and Jitendra Malik · 2000
Earlier work this paper cites.

Similar

A tutorial on spectral clustering
Ulrike Von Luxburg · 2007
Cited alongside, same era.
The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains
David I Shuman, Sunil K Narang, Pascal Frossard, Antonio Ortega, and Pierre Vandergheynst · 2013
Cited alongside, same era.
Learning deep representations for graph clustering
Fei Tian, Bin Gao, Qing Cui, Enhong Chen, and Tie-Yan Liu · 2014
Cited alongside, same era.

Then

Spectral networks and locally connected networks on graphs
Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann Lecun · 2014
Later among the works it cites.
Arbitrary-order proximity preserved network embedding
Ziwei Zhang, Peng Cui, Xiao Wang, Jian Pei, Xuanrong Yao, and Wenwu Zhu · 2018
Closest in time.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…