Graph Analytics, Pagerank, Spectral Clustering, Machine Learning, AI.
eigen vectors. The second step of spectral clustering is to find the top k eigen vectors of this graph. For example in the above image: W represents the top k eigen vectors. The middle block is an eigen matrix with the diagonal as the eigen value. Third step is to create clusters of k groups of