Abstract:
The automatic search and community discovery in large and complex network has important practical applications. This paper applies the hypergraph based model and cluster algorithm in community structure discovery, introduces the concept of Edge Clustering Coefficient(ECC) to community structure discovery of simple graph and proposes an algorithm of community discovery based on ECC. Enron e-mail data sets are test data sets, through comparative analysis of algorithm, to prove that this algorithm can significantly improve the time complexity.
Key words:
Edge Clustering Coefficient(EBB),
community structure,
community discovery
摘要: 在大型复杂网络中自动搜寻或发现社区具有重要的实际应用价值。该文把超图模型以及基于此的聚类算法应用到社区结构发现的领域。对于简单图的社区结构发现,引入边聚集系数的概念,提出基于边聚集系数的社区发现算法。将安然邮件数据集作为测试数据集,通过算法对比分析,证明该算法在时间复杂度上可以提高一个数量级。
关键词:
边聚集系数,
社区结构,
社区发现
CLC Number:
HU Jian; DONG Yue-hua; YANG Bing-ru. Community Structure Discovery Algorithm in Large and Complex Network[J]. Computer Engineering, 2008, 34(19): 92-93,1.
胡 健;董跃华;杨炳儒. 大型复杂网络中的社区结构发现算法[J]. 计算机工程, 2008, 34(19): 92-93,1.