基于边聚集系数的社区结构发现算法

Community structure discovery algorithm based on edge clustering coefficient

将超图模型以及基于此的聚类算法应用到社区结构发现的领域。对于简单图的社区结构发现,引入边聚集系数的概念,提出了基于边聚集系数的社区发现算法。将安然邮件数据集作为测试数据集,通过算法对比分析,证明该算法在时间复杂度上可以提高一个数量级。

This paper applied the hypergraph based model and cluster algorithm in community structure discovery.Introduced the concept of edge clustering coefficient(ECC) to community structure discovery of simple graph and proposed an algorithm of community discovery based on ECC.Enron e-mail data sets will be a test data sets,through comparative analysis of algorithm,to prove that this algorithm can significantly improve the time complexity.