基于边密度聚类的重叠社区发现算法

Overlapping Community Detection Based on Edge Density Clustering

基于边聚类的社区发现算法以边为聚类对象,自然发现重叠社区,但也存在生成的社区集边界归属模糊、社区结构过度重叠等问题.基于此种情况,文中提出基于边密度聚类的重叠社区发现算法.首先,以边为研究对象,通过密度聚类检测连接紧密的核心边社区.然后,根据边界边归属策略将边界边划分到离它最近的核心边社区.针对孤立边,提出基于边的度与边的社区归属的孤立边处理策略,进一步处理未划分的孤立边,避免社区结构过度重叠的问题.最后,将边社区还原为节点社区,实现重叠社区的发现.在人工数据集和真实数据集上的实验表明,文中算法可以快速准确地检测复杂网络中的重叠社区.

Community detection based on edge clustering is capable of detecting overlapping communities naturally. However, it engenders the problems of obscure belongingness of the nodes on community borders and the excessive overlap of communities. In this paper, an overlapping community detection based on edge density clustering（OCDEDC） algorithm is proposed. Firstly, density clustering based on edges is employed to extract core edge communities. Next, a partitioning strategy is designed to dispatch border edges to its closest core edge community. In addition, a strategy based on the degrees and community belongingness of edges is designed to handle the isolated edges, and thus the excessive overlap of communities is avoided. Finally, edge communities are transformed back into node communities as the output. Experiments on artificial and real datasets show that the proposed algorithm detects overlapping communities effieiently and effeetively.