PageRank and The K-Means Clustering Algorithm
share
We introduce a graph clustering algorithm that generalizes k-means to graphs. Our method utilizes PageRank measures on graphs to quickly and robustly compute centrality of nodes in a given graph. Furthermore, we show how our method can be generalized to metric spaces and apply it to other domains such as point clouds and triangulated meshes.
READ FULL TEXT