计算机工程与应用2016，Vol.52Issue(23)：75-80,6.DOI:10.3778/j.issn.1002-8331.1412-0130
带源节点的快速社区发现算法
Fast communities detection algorithm with source nodes
摘要
Abstract
An improved CNM community detection algorithm is proposed to detect communities in a complex network with certain nodes already partitioned. These nodes are defined as the source nodes in this algorithm which uses the modu-larity increment maximization as the objective function to group the unpartitioned nodes. Communities are identified by the proposed algorithm when the highest total modularity is reached. An example based on the mobile phone data collected in Shenzhen, China is applied to the algorithm. The base stations in the planed urban centers are treated as the source nodes in the algorithm to detect the communities in Shenzhen. The results indicate that the proposed algorithm is effective in detecting the boundaries of major urban centers as well as other urban communities.关键词
复杂网络/社区发现/模块度Key words
complex network/community detection/modularity分类
信息技术与安全科学引用本文复制引用
刘立寒,方志祥,萧世伦,尹凌..带源节点的快速社区发现算法[J].计算机工程与应用,2016,52(23):75-80,6.基金项目
国家自然科学基金（No.41231171，No.41371420）；资源与环境信息系统国家重点实验室开放基金（No.201303）。 （）
