摘要： 为了快速准确地找到复杂网络的社团结构，提出一种基于共享邻居数和局部模块度的社团结构发现算法。该方法通过不断寻找节点之间的共享邻居数找出与社团连接性最强的节点，并以局部模块度为衡量标准，判断是否将该节点加入到社团中。对3个典型复杂网络的划分结果表明，该算法是可行和有效的。
关键词:
复杂网络,
社团结构,
共享邻居,
局部模块度
Abstract: To partition complex networks into groups fast and correctly, this paper proposes an algorithm for detecting community structures in complex networks based on shared neighbors and local modularity. By looking for the numbers of shared neighbors between nodes one by one, the node connected closely with the community is found, and the local modularity is used to decide whether this found node is added into the community. Three typical complex networks are used to test the performance of the algorithm. Experimental results show that it is viable and effective.
Key words:
complex network,
community structure,
shared neighbor,
local modularity
中图分类号:
刘微, 张大为, 嵇敏, 谢福鼎. 基于共享邻居数的社团结构发现算法[J]. 计算机工程, 2011, 37(6): 172-174.
LIU Wei, ZHANG Da-Wei, JI Min, XIE Fu-Ding. Community Structure Detection Algorithm Based on Number of Shared Neighbors[J]. Computer Engineering, 2011, 37(6): 172-174.