交联网络中的可重叠社团结构分析算法  

Algorithm to Analyze Overlapping Community Structure of Intersection Networks

作　　者：赵鹏[1] 蔡庆生[2] 王清毅[2] 

机构地区：[1]安徽大学计算智能与信号处理教育部重点实验室,安徽合肥230039 [2]中国科学技术大学计算机科学技术系,安徽合肥230027

出　　处：《华南理工大学学报（自然科学版）》2008年第5期19-23,共5页Journal of South China University of Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(70171052);安徽省高校青年教师基金资助项目(2006jq1040)

摘　　要：现有的社团结构分析算法都是针对非交联结构的复杂网络,并且大多数是将网络划分为若干相互分离的社团,无法对彼此重叠、互相关联的社团结构进行分析.文中根据交联网络的结构特点,提出了一种交联网络中的可重叠社团结构分析算法(IBCPM算法),并利用该算法对用户收藏文章的交联网络进行了社团结构分析,对所获得的社团结构进行了统计分析.实验结果证明了文中算法的有效性及效率.The existing algorithms to analyze the community structure are all based on the complex networks with non-intersection structure,and most of them can only analyze the separated community structures rather than to ana-lyze the overlapping and intersecting ones.In order solve this problem,a novel algorithm to analyze the overlapping community structure of intersection network is proposed.The proposed algorithm,IBCPM,is then adopted to analyze the community structure of the user＇s collection intersection network,and the results are further statistically analyzed.The effectiveness and efficiency of the proposed algorithm are finally verified by experiments.

关 键 词：复杂网络 交联网络 社团结构 算法 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]