大规模复杂网络中的社团快速发现算法  

A Speedy Algorithm for Detecting Community of Large-scale Complex Network

作　　者：刘波涛[1] 

机构地区：[1]湖南文理学院计算机科学与技术学院,湖南常德415000

出　　处：《科技通报》2012年第8期137-139,共3页Bulletin of Science and Technology

摘　　要：现有的社团发现算法大多是针对中等规模的复杂网络,而对大规模复杂网络进行社团发现时时间花销很大。针对这种问题,本文提出了一种用于大规模复杂网络的社团快速发现算法,给出了模块度及模块度增量的定义。基于这些定义给出了一个两阶段社团发现算法。测试网络的实验结果验证了所提算法的有效性。The existing community structure detecting algorithm is mostly found in moderate scale complex network,they will take a lot of expenses on time when found in large-scale complex network.To solve this problem,a speedy algorithm for detecting community of large-scale complex network is proposed in this paper.These definitions of module degrees and incremental module degrees are given,a community structure detecting algorithm with two stage based on these definitions are given,and the effectiveness of the proposed algorithm are verified by using test network experimental results in the end.

关 键 词：大规模复杂网络 社团结构 模块度 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]