Lecture 7 — April 21 7.1 Spectral Clustering


is the degree matrix and elucidate some of its key properties that make it suitable for clustering. Suppose we form a weighted graph G with our data-points being the vertices and the edge weights being specified by the weight matrix W . Let us first consider the special case when the graph G has exactly k components with vertex sets A1, · · · , Ak. Then the Laplacian Lrw has the following properties.

Cite this paper

@inproceedings{Sen2014Lecture7, title={Lecture 7 — April 21 7.1 Spectral Clustering}, author={Subhabrata Sen}, year={2014} }