Skip to content

Detecting communities in social networks with graph convolutional neural networks

Sep 2026 · Discover Artificial Intelligence · Vol 6 · 0 citations · 45 references
Computer Science

TL;DR

A new, end-to-end framework that combines heterogeneous node embeddings as Metapath2Vec with a multi-layer Graph Convolutional Network (GCN) with multi-head attention and adaptive neighbourhood aggregation is introduced.

Abstract

The latent community structures in the social networks have now become a cornerstone problem in the scientific study of networks, and has extensive implications in recommendation systems, epidemiology, fraud detection, and social behavior studies. The conventional community detection algorithms, most of which are based on spectral clustering, modularity maximization, and random walk heuristic, do not scale and generalize when there are heterogeneous, multi-relational graph structures that define contemporary online social networks. Over the past few years, graph representation learning and deep neural architecture have converged, providing intriguing new directions of community discovery. The article introduces a new, end-to-end framework that combines heterogeneous node embeddings as Metapath2Vec with a multi-layer Graph Convolutional Network (GCN) with multi-head attention and adaptive neighbourhood aggregation. The embedding module by embedding semantically meaningful metapaths, Author–Paper–Author (A–P–A), Author–Paper–Conference–Paper–Author (A–P–C–P–A), and Author–Paper–Keyword–Paper–Author (A–P–K–P–A), defines the heterogeneous relational structure of academic networks. These enhanced embedding are further optimized by three stacked GCN layers with LeakyReLU activation, batch normalization and dropout regularization to avert overfitting. The output node representations are categorized through a softmax layer which gives the probability of membership to a community. Extensive experiments on the two heterogeneous network benchmarks, DBLP and ACM, prove that the proposed method is accurate (87.1) and has an F1-score of 86.0 on DBLP, and 89.3 accuracy with F1-score 88.7 on ACM, outperforming a dozen baselines, including recent 20,232,024 state-of-the-art The reasons as to why the three inductive biases provided by Metapath2Vec, GCN aggregation, and multi-head attention are complementary to each other are supported by a theoretical analysis. Ablation experiments verify the value of each of the components, a case study demonstrates how the model solves the ambiguous boundaries of communities and sensitivity analysis confirms the strength of the hyperparameter selections.

Read PDF

Similar papers

Conference Aug 2026

Performance Trade-offs of Community Detection Algorithms in Dense and Sparse Network Topologies

Community detection is commonly used to uncover latent group structure in complex networks, but its effectiveness is highly dependent on the topology of the graph being analyzed. An algorithm that performs well on a dense social network may not show the same behavior on a sparse collaboration network, making it difficu...

Renaldy Fredyan, Donny Fernando · 0 citations
Review Open access Sep 2026

Spectral Graph Methods for Community Detection in Complex Networks

By connecting core linear algebra with practical structure discovery, the review clarifies both the continuing value and the limits of the spectral perspective.

Ji Li · 0 citations
Preprint Sep 2026

Exact Community Recovery in Bipartite Networks

This work proves that a simple spectral clustering algorithm based on the diagonal-deleted Gram matrix achieves exact recovery with high probability under mild conditions on sparsity, community balance, and the number of clusters.

Huan Qing · 0 citations
#graph neural networks Open access Sep 2026

Preserving the Motif-Relevant Structure in Graph Neural Networks: An Entropy-Aware Study of Aggregation and Depth

Graph neural networks have shown strong potential for learning structural representations of biological networks. However, repeated message passing may blur local structural signals that are relevant for motif- and graphlet-based analysis. This paper investigates multilabel graphlet classification in protein–protein in...

Lidija Kunst, Friedhelm Schwenker, H. Kestler · 0 citations
#machine learning Open access May 2024

Robustness of shallow graph embedding methods for community detection

The robustness of shallow graph embedding methods for community detection in the face of network perturbations is found to be influenced by factors such as network size, initial community partition strength, and the type of perturbation.

Zhi-Feng Wei, P. Moriano, Ramakrishnan Kannan · 3 citations
Preprint Aug 2026

Scalable dynamic community detection on temporal graphs using graph neural networks

This work formulate dynamic community detection over observed node-time instances, where each node-time instance in the temporal interaction stream is assigned a cluster label and proposes a diffusion-guided contrastive learning framework that uses a local temporal diffusion affinity matrix to construct positive and ne...

Pei-Jie Zhong, Raul J. Mondragón, Richard G. Clegg · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.