一种用于大图数据聚类的有限随机游走算法
Limited Random Walk Algorithm for Big Graph Data Clustering
摘要:
图聚类是理解大型图中顶点之间关系的重要技术。在本文中,我们提出了一种新的基于随机游走的图聚类方法。所提出的方法使用膨胀函数和归一化函数限制步行代理的范围。我们分析了有限的随机游走过程的行为,并提出了一种新的算法的全局和局部图聚类问题。以前的基于随机游走的算法依赖于所选择的适应度函数来找到种子顶点周围的聚类。所提出的算法以完全不同的方式解决问题。我们使用有限的随机游走过程中找到吸引顶点的图,并使用它们作为功能的顶点进行聚类。仿真图数据和真实大图数据的实验结果表明,该方法在解决图聚类问题上优于现有方法.由于所提出的方法使用了并行的范例,它可以有效地实现和嵌入在任何并行计算环境,如MapReduce框架。如果有足够的计算资源,我们能够在合理的时间内聚类具有数百万个顶点和数亿条边的图。
英文摘要:
Graph clustering is an important technique to understand the relationships between the vertices in a big graph. In this paper, we propose a novel random-walk-based graph clustering method. The proposed method restricts the reach of the walking agent using an inflation function and a normalization function. We analyze the behavior of the limited random walk procedure and propose a novel algorithm for both global and local graph clustering problems. Previous random-walk-based algorithms depend on the chosen fitness function to find the clusters around a seed vertex. The proposed algorithm tackles the problem in an entirely different manner. We use the limited random walk procedure to find attracting vertices in a graph and use them as features to cluster the vertices. According to the experimental results on the simulated graph data and the real-world big graph data, the proposed method is superior to the state-of-the-art methods in solving graph clustering problems. Since the proposed method uses the embarrassingly parallel paradigm, it can be efficiently implemented and embedded in any parallel computing environment such as a MapReduce framework. Given enough computing resources, we are capable of clustering graphs with millions of vertices and hundreds millions of edges in a reasonable time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。