摘要
探测复杂网络中的社团结构对更好地理解网络的整体结构与功能特性有着十分重要的实际意义和应用价值。基于共享邻居数目和社团强度定义提出了以边链接系数为分裂依据的快速探测算法。实验结果表明,与已有的划分算法相比,该算法不需要事先预知社团数目和原始社团划分情况,能够在较低的时间复杂度下得到更高质量的网络社团划分结果。
Detecting community structure in complex networks has significant implications for both theoretical researches and practical applications,and can be used to analyze the topological structures,understand the functions.It proposed a fast splitting algorithm based on edge linking coefficient and community strength.The results show that it does not require any priori knowledge about the number or the original division of the communities.It has better partitioning ability and lower time complexity than the proposed partitioning community structure algorithms.
出处
《科技通报》
北大核心
2013年第1期132-135,共4页
Bulletin of Science and Technology
基金
山西省科技攻关项目(20090321016)
山西省基础研究项目(20081008)
关键词
复杂网络
社团结构
模块度
边链接系数
complex networks
community structure
modularity
edge linking coefficient
