论文标题
Pagerank和K-均值聚类算法
PageRank and The K-Means Clustering Algorithm
论文作者
论文摘要
我们利用Pagerank矢量来概括$ k $ -MEANS聚类算法，以指导和无向图。我们证明，可以在我们的设置中使用Pagerank和其他中心度度量来鲁棒地计算给定图中的节点的中心性。此外，我们展示了如何将我们的方法推广到公制空间并将其应用于其他域，例如点云和三角形网格
We utilize the PageRank vector to generalize the $k$-means clustering algorithm to directed and undirected graphs. We demonstrate that PageRank and other centrality measures can be used in our setting to 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
