动态网络中基于局部介数的重叠社区发现算法

A dynamic network overlapping communities detecting algorithm based on local betweenness

针对现有静态网络社区发现算法的失真和动态网络社区发现算法时间复杂度较高的问题,本文提出了一种动态网络中的重叠社区发现算法。在网络中,边介数最大的边或分割介数最大的节点是网络中的关键边或点,即联系最不紧密的边或节点,因此,该算法利用去除最大边介数的边和分裂最大分割介数的节点的方法,并将网络社区的动态变化和重叠性考虑在内进行社区发现。最后利用模块度对社区发现进行控制,使发现的社区结构更加合理。

Aimed at the problem of distortion in the static network and higher time complexity in the dynamic network,a overlap community detecting algorithm for a dynamic network is proposed,in which the idea is that the edge of the maximum edge betweenness or node of the maximum split betweenness is the key link edge or node.Considering the dynamics and overlapping in the network community,communities found is achieved,based on removing the edge of maximum edge betweenness or dividing the point of maximum split betweenness.Finally,under the control of community detection by modularity,the community structure becomes more reasonable.