基于引力因子的加权网络重叠社区识别算法-计算机科学.PDFVIP

Vo 1. 43 No. 12 第 43 卷第12 期 计算机科学 2016 年 12 月 Computer Science Dec 2016 基于引力因子的加权网络重叠社区识别算法 刘冰玉王翠荣王聪苑迎 (东北大学信息科学与工程学院 沈阳 110819) 摘 要 通过挖掘大数据来识别复杂社会网络上的社区，有利于对经济、政治、人口等方面的重要问题进行定量研究， 社区的识别算法已经成为当前研究的热点问题。重点研究了重叠社区识别问题，提出了基于引力因子的加权复杂网 络的重叠社区识别算法 GWCR。该算法首先选取万有引力因子大的节点为中心节点，将节点与中心节点之间的引力 因子作为衡量标准，并将节点归入社区引力因子大于某一阅值的社区，最后通过识别重叠节点来识别重叠社区。在 3 个真实网络数据集上的实验结果表明，与传统的重叠社区识别算法相比，GWCR 算法划分的社区的模块度较高。 关键词 引力因子，社区识别，加权网络，重叠社区 中图法分类号 TP393.02 文献标识码 A 001 10. 11896/j. issn. 1002-137叉 2016.12.027 Overlapping Community R配ognition Algorithm of Weighted Networks ßased on Gravity Factor LIU Bing-yu WANG Cui-rong WANG Cong YUAN Ying (School of Information . Engineering ,Northeastem University ,Shenyang 1l00819 ,China) Abstract The recognition of community in complex social networks by mining big data can favor the quantitative re search for economic ,political and demographic problems. Community recognition algorithms have become a hot topic of current research. This paper focused on the research of overlapping community discovery ,and proposed the overlapping community detection algorithm GWCR ,which is based on gravity factor of weighted networks. Firstly ,the GWCR algo rithm selects the node with the largest gravitation factor as the center node ,and uses the gravitation factor between one node and the central node as a measure. The node whose gravitation factor is larger than the threshold will be included in the community. Finally , overlapping communities are discovered by identifying overlapping nodes. Experimental re sults on three real netw