Hierarchical Overlapping Community Discovery Algorithm Based on Node Purity

摘要：

　　A hierarchical overlapping community discovery algorithm based on node purity (OCFN-PN) is proposed in the paper.This algorithm chooses the maximal relative centrality as the initial community,which solves the problem of inconsistent results of the community discovery algorithm based on fitness resulting from randomly choosing nodes.Before optimizing and merging communities,the community overlapping degree and the joint-union should be calculated so that the problems of twice merging can be solved.Research results show that this algorithm has lower time complexity and the communities obtained by this algorithm are more suitable for real world networks.

关键词： hierarchical overlapping community discovery algorithm node purity relative centrality overlapping degree the joint-union

作者: Guoyong Cai Ruili Wang Guobin Liu

作者单位: Guilin University of Electronic Technology,Guilin,Guangxi,China

会议类型: 国际会议

会议名称: 7th IFIP TC 12 International Conference (第七届智能信息处理国际会议 (IIP 2012))

会议地点: 桂林

会议语种:英文

页码: 248-257

在线出版日期: 2012-10-12（万方平台首次上网日期，不代表论文的发表时间）