计算机应用研究2011，Vol.28Issue(4)：1242-1244,1250,4.DOI:10.3969/j.issn.1001-3695.2011.04.010
复杂网络中社团结构划分的快速分裂算法
Fast splitting algorithm for partitioning community structure in complex networks
摘要
Abstract
Most of the proposed splitting algorithms are not suitable for very large networks because of their high time complexity and unknown quantity of community number.Referencing the voltage spectrum segmentation algorithm and GN algorithm,this paper proposed a fast splitting algorithm based on diffusion distance and the modularity function.Its segmentation basis was the diffusion distance, and the ability of modularity function could find the best community number in large networks.Experimental results show that the algorithm has better partitioning ability and lower time complexity than the proposed partitioning community structure algorithms.Not only it is capable of fast operation for the sparse network, but also for the non-sparse network, which reflects the algorithm has high stability.关键词
复杂网络/社团结构/分裂算法/模块度/扩散距离Key words
complex networks/ community structure/ splitting algorithm/ modularity/ diffusion distance分类
信息技术与安全科学引用本文复制引用
张聪,沈惠璋,李峰..复杂网络中社团结构划分的快速分裂算法[J].计算机应用研究,2011,28(4):1242-1244,1250,4.基金项目
国家自然科学基金资助项目(71071096) （71071096）
高等学校博士学科点专项科研基金资助项目(20070248054) （20070248054）
