Affiliations: School of Computer Science and Engineering, Central South University, Hunan Province, China
Correspondence:
[*]
Corresponding author. Bin Wang, School of Computer Science and Engineering, Central South University, Hunan Province, China. E-mail: wb_csut@csu.edu.cn.
Abstract: In a complex network system, the structure of the network is an extremely important element for the analysis of the system, and the study of community detection algorithms is key to exploring the structure of the complex network. Traditional community detection algorithms would represent the network using an adjacency matrix based on observations, which may contain redundant information or noise that interferes with the detection results. In this paper, we propose a community detection algorithm based on density clustering. In order to improve the performance of density clustering, we consider an algorithmic framework for learning the continuous representation of network nodes in a low-dimensional space. The network structure is effectively preserved through network embedding, and density clustering is applied in the embedded low-dimensional space to compute the similarity of nodes in the network, which in turn reveals the implied structure in a given network. Experiments show that the algorithm has superior performance compared to other advanced community detection algorithms for real-world networks in multiple domains as well as synthetic networks, especially when the network data chaos is high.
Keywords: Complex network, community detection, network embedding, density clustering
