一种新型简单图社区结构发现算法

在大型复杂网络中自动搜寻或发现社区具有重要的实际应用价值。该文把超图模型以及基于此的聚类算法应用到社区结构发现的领域。对于简单图的社区结构发现,引入边凝聚系数的概念,提出了基于边凝聚系数的社区发现算法。将安然邮件数据集作为测试数据集,通过算法对比分析,证明该算法在时间复杂度上可以提高一个数量级。

New community structure discovery algorithm of simple graph

The automatic search and community discovery in large and complex network has important practical applications.The hypergraph based model and cluster algorithm in community structure discovery is applied.This paper introduces the concept of Edge Clustering Coefficien(tECC) to community structure discovery of simple graph and proposes an algorithm of community discovery based on ECC.Enron e-mail data sets will be test data sets.Through comparative analysis of algorithm,it is proved that this algorithm can si...