arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.05359cs.SIphysics.soc-ph
收藏

基于局部边缘介数的加权标签传播算法

Weighted Label Propagation Algorithm based on Local Edge Betweenness

Hamid Shahrivari Joghan, Alireza Bagheri, Meysam Azad

摘要:

在复杂网络中,特别是社交网络中,网络可以被划分为不相交的分区,其中内部边(同一分区内顶点之间的边)与外部边(不同分区的两个顶点之间的边)的数量之比很高。通常,这些分区被称为社区。检测这些社区有助于数据科学家从图表中提取有意义的信息并进行分析。在过去的几十年里,已经提出了各种算法来检测图中的社区,每个算法都从不同的角度研究了这个问题。然而,这些算法中的大多数具有显著的时间复杂度和昂贵的计算,使得它们不适合在具有数百万条边和节点的大型图中检测社区。在本文中,我们尝试通过使用边缘介数度量来改进标签传播算法,使其能够在接近线性的时间复杂度内以可接受的精度识别真实世界和人工网络中的不同社区。此外,该算法可以检测社区的加权图。实验结果表明,该算法在准确性和速度上都是可以接受的,并且具有良好的可扩展性。

英文摘要:

In complex networks, especially social networks, networks could be divided into disjoint partitions that the ratio between the number of internal edges (the edges between the vertices within same partition) to the number of outer edges (edges between two vertices of different partitions) is high. Generally, these partitions are called communities. Detecting these communities helps data scientists to extract meaningful information from graphs and analyze them. In the last decades, various algorithms have been proposed to detect communities in graphs, and each one has examined this issue from a different perspective. However, most of these algorithms have a significant time complexity and costly calculations that make them unsuitable to detect communities in large graphs with millions of edges and nodes. In this paper, we have tried to improve Label Propagation Algorithm by using edge betweenness metric, so that it is able to identify distinct communities in both real world and artificial networks in near linear time complexity with acceptable accuracy. Also, the proposed algorithm could detect communities in weighted graphs. Empirical experiments show that the accuracy and speed of the proposed algorithm are acceptable; additionally, the proposed algorithm is scalable.

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

↑