Community detection in attributed social networks using deep learning

Existing methods for detecting communities in attributed social networks often rely solely on network topology, which leads to suboptimal accuracy in community detection, inefficient use of available data, and increased time required for identifying groups. This paper introduces the Dual Embedding-based Graph Convolution Network (DEGCN) to address these challenges. This new method uses graph embedding techniques in a new deep learning framework to improve accuracy and speed up community detection by combining the nodes’ content with the network’s topology. Initially, we compute the modularity and Markov matrices of the input graph. Each matrix is then processed through a graph embedding network with at least two layers to produce a condensed graph representation. As a result, a multilayer perceptron neural network classifies each node’s community based on these generated embeddings. We tested the suggested method on three standard datasets: Cora, CiteSeer, and PubMed. Then, we compared the outcomes to many basic and advanced approaches using five important metrics: F1-score, adjusted rand index (ARI), normalized mutual information (NMI), and accuracy. The findings demonstrate that the DEGCN accurately captures community structure, achieves superior precision, and has higher ARI, NMI, and F1 scores, significantly outperforming existing algorithms for identifying community structures in medium-scale networks.