%A ZHANG Yi-ming, WANG Guo-yin, HU Jun, FU Shun
%T Overlapping community detection based on density peaks and network embedding
%0 Journal Article
%D 2021
%J JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
%R 10.6040/j.issn.1671-9352.4.2020.145
%P 91-102
%V 56
%N 1
%U {http://lxbwk.njournal.sdu.edu.cn/CN/abstract/article_3396.shtml}
%8
%X Density peaks is a density-based clustering algorithm. It assumes that the center points of the cluster have higher density and are surrounded by nodes with lower density. Due to the character of graph structure, density peaks cannot be directly applied to network structure, and most of density peaks based community detection algorithms based on density peaks are based on graph topology or adjacency matrix to measure node approximation, which often leads to great computational complexity. This paper proposes an overlapping community detection algorithm based on density and network embedding(OCDDNE). The proposed algorithm firstly embeds the network structure characteristics of nodes in network structure through network embedding, and then clusters the embedded node vectors based on the improved method of density peaks, so that the structural relationship between the encoded vectors can be better revealed and the overlapping communities which each node is located is determined. Experiments on synthetic networks and real networks data show that the proposed algorithm can efficiently find the overlapping community structure in networks, and it is superior to other algorithms especially in complex networks with high structural complexity.