Mathematics Graphs and recommendation
[Graph theory] The Fiedler vector and spectral clustering (Rewritten from an earlier blog post)
Derive why Fiedler vectors help partition graphs using the Laplacian quadratic form and a continuous relaxation of RatioCut. Check eigenvalues and sign-based partitions on four vertices, then develop spectral clustering with a normalized Laplacian. Use Python to partition two-moons data and compare the result with ordinary K-means.
