Spectral Clustering

1 selectedDifficulty 8-81 unseenView topic

AdvancedNew

0 answered

1 advancedAdapts to your performance

Question 1 of 1

120sadvanced (8/10)conceptual

Spectral clustering constructs a similarity graph and computes eigenvectors of the graph Laplacian L = D - W (or its normalized variant). Why does the multiplicity of the zero eigenvalue of L equal the number of connected components in the graph?