摘要
为了准确地检测出复杂网络的社团结构,提出一种基于信号自适应传递的社团发现方法。首先使信号在复杂网络上自适应地传递,从而获取网络中各节点对整个网络的影响向量,然后把网络中节点的拓扑结构转化成代数向量空间上的几何关系,最后结合聚类特性发现网络中的社团结构。为获取更加合理的空间向量,提出最佳传递次数,缩小搜索空间,增强算法寻优能力。该算法在计算机生成网络、Zachary网络和美国大学生足球赛网络上进行实验测试,并与GN算法、谱聚类算法、极值优化算法和信号传递算法进行实验对比,社团划分的准确性和精确性均有所提高,证明该算法具有有效性和可行性。
In order to accurately detect the community structure of complex networks, a community detection algorithm based on signal adaptive transmission was proposed. First, the signal was adaptively passed on complex networks, thereby getting the vector affecting on the entire network of each node, then the topological structure of each node was translated into geometrical relationships of algebra vector space. Thus, according to the nature of the clustering, the community structure of the network was detected. In order to get the feasible spatial vectors, the optimum transfer number was determined, which reduced the searching space, and effectively strengthened the search capability of community detection. The proposed algorithm was tested on computer-generated network, Zachary network and American college football network. Compared with Girvan- Newman (GN) algorithm, spectral clustering algorithm, extremal optimization algorithm and signal transmission algorithm, the results show that the accuracy and precision of the proposed community division algorithm is feasible and effective.
出处
《计算机应用》
CSCD
北大核心
2015年第6期1552-1554,1594,共4页
journal of Computer Applications
基金
陕西自然科学基金资助项目(2014JZ021)
陕西省重点科技创新团队项目(2014KTZ-18)
榆林市产学研合作项目(2012cxy3-6)
关键词
复杂网络
社团结构
自适应
传递次数
社团发现算法
complex network
community structure
adaptability
transfer number
community detection algorithm