arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.07515cs.DC
收藏

并行局部图聚类

Parallel Local Graph Clustering

Julian Shun, Farbod Roosta-Khorasani, Kimon Fountoulakis, Michael W. Mahoney

摘要:

图聚类在计算中有许多重要的应用,但由于图的大小不断增加,即使是传统的快速聚类方法,如谱划分,对于现实世界的感兴趣的图来说,计算成本也很高。部分出于这一动机,所谓的局部算法图聚类已收到显着的兴趣,由于这样的事实,他们可以找到良好的集群在一个图形中的工作成比例的集群的大小,而不是整个图形。事实证明,这个特性对于使这种图聚类及其许多下游应用程序在实践中高效至关重要。虽然局部聚类算法已经比触及整个图的传统算法更快,但它们是顺序的,并且有机会通过并行化使它们更有效。在本文中,我们展示了如何并行化这些算法中的许多共享内存多核设置,我们分析了这些算法的并行复杂性。我们提出了全面的大规模图形实验表明,我们的并行算法实现了良好的并行加速现代多核机器,从而显着加快了本地图形集群的分析在非常大规模的设置。

英文摘要:

Graph clustering has many important applications in computing, but due to growing sizes of graphs, even traditionally fast clustering methods such as spectral partitioning can be computationally expensive for real-world graphs of interest. Motivated partly by this, so-called local algorithms for graph clustering have received significant interest due to the fact that they can find good clusters in a graph with work proportional to the size of the cluster rather than that of the entire graph. This feature has proven to be crucial in making such graph clustering and many of its downstream applications efficient in practice. While local clustering algorithms are already faster than traditional algorithms that touch the entire graph, they are sequential and there is an opportunity to make them even more efficient via parallelization. In this paper, we show how to parallelize many of these algorithms in the shared-memory multicore setting, and we analyze the parallel complexity of these algorithms. We present comprehensive experiments on large-scale graphs showing that our parallel algorithms achieve good parallel speedups on a modern multicore machine, thus significantly speeding up the analysis of local graph clusters in the very large-scale setting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑