Machine Learning, Data Science, Dimensionality Reduction, Svd, Linear Algebra.
is similar to Find the Laplacian (L) of the Affinity Matrix: L = A — D Find the highest k eigenvectors of the Laplacian Matrix depending on their eigenvalues Run k-means on these eigenvectors to cluster the objects into k classes You can read about the complete algorithm and its math here. The