High-performance community detection in social networks using a deep transitive autoencoder

Community structure is an important characteristic of complex networks. It determines where important functions of a network are located. Recently, discovering community structure in complex networks has become a hot topic of research. However, the continuous increase in network size has made network structure more complex, and community detection has become extremely difficult in real applications. In particular, the detection results are usually not accurate enough when classical clustering methods are applied to high-dimensional data matrices. In this paper, inspired by the relationship between vertices, we design a novel and effective network adjacency matrix transformation method to describe vertices’ similarity in the network topology . On this basis, we propose a framework to extract nonlinear features : community detection with deep transitive autoencoder (CDDTA). This framework can obtain powerful nonlinear features of a real network to make community detection algorithms perform excellently in practice. We further incorporate unsupervised transfer learning into the CDDTA (Transfer-CDDTA) by minimizing the Kullback–Leibler divergence of embedded instances, to discover powerful low-dimensional representations. Finally, we propose a new training strategy and optimization method for our algorithm. Extensive experimental results indicate that our new framework can ensure good performance on both real-world networks and artificial benchmark networks, which outperforms most of the state-of-the-art methods for community detection in social networks.