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

通过仿蜂群系统迭代边移除进行网络社区检测

Network community detection via iterative edge removal in a flocking-like system

Institute of Mathematics and Computer Science, University of São Paulo(圣保罗大学数学与计算机科学研究所);School of Computer Science, Zhongyuan University of Technology(中原工学院计算机学院);Ribeirão Preto School of Philosophy, Science and Literature, University of São Paulo(圣保罗大学里贝朗普雷图哲学、科学与文学院)

Filipe Alves Neto Verri, Roberto Alves Gueleri, Qiusheng Zheng, Junbao Zhang, Liang Zhao

AI总结:

本文提出一种基于仿蜂群系统迭代移除边的网络社区检测方法,通过非线性动态对齐顶点,最终形成连通组件,适用于多种网络类型,尤其在大规模稀疏网络中效率高。

摘要:

我们提出了一种基于自然界对齐粒子系统特性的一种网络社区检测技术。最初,每个顶点被赋予一个随机方向的单位向量。建立了一种非线性动态法则,使得相邻顶点试图彼此对齐。经过一段时间后,系统停止,移除连接最不一致顶点对的边。然后,进化过程重新开始,不包含已移除的边,经过足够数量的移除轮次后,每个社区成为连通组件。所提出的方法使用广泛接受的基准和现实世界网络进行评估。实验结果表明,该方法在各种网络上表现稳健且出色。此外,对于大规模稀疏网络,边移除过程在准线性时间内运行,这使得该方法适用于大规模网络。

英文摘要:

We present a network community-detection technique based on properties that emerge from a nature-inspired system of aligning particles. Initially, each vertex is assigned a random-direction unit vector. A nonlinear dynamic law is established so that neighboring vertices try to become aligned with each other. After some time, the system stops and edges that connect the least-aligned pairs of vertices are removed. Then the evolution starts over without the removed edges, and after enough number of removal rounds, each community becomes a connected component. The proposed approach is evaluated using widely-accepted benchmarks and real-world networks. Experimental results reveal that the method is robust and excels on a wide variety of networks. Moreover, for large sparse networks, the edge-removal process runs in quasilinear time, which enables application in large-scale networks.

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

↑