基于节点动态连接度的网络社团划分算法

首先定义了节点动态连接度这一概念,然后介绍了基于节点动态连接度的网络社团划分算法,之后再对其中相关参数的取值范围和社团划分结果之间的关系进行了分析,并以Zachary网络为例验证了分析结论。在此基础上,以dolphins、polbooks和football 3个实际网络为对象,进行了社团划分实验,证明了本算法可通过动态调整参数实现对不同网络的社团划分。最后将实验结果与其他几种常见的社团划分算法结果进行了比较,证明了算法的优势,并对算法中需要注意的一些问题进行了说明。

Finding Community Structure in Networks Using Node's Dynamic Connection Degree

This paper gives the definition of node's dynamic connection degree at first, and then introduces the algorithm of finding the community structure by the node's dynamic connection degree.After that, it analyzes the range of parameter's value in node's connection degree and proves it by experimenting on the Zachary network.On this basis, it experiments on three real networks which are dolphins, polbooks and football.The result proves that this algorithm can find different network's community structure correctly by adjust its parameter's value.At last, it compares the result with some other common algorithms' and illustrates some matters that need attention.