Skip to content
Open access

ADAPT-Net: an adaptive dynamic attention and persistence-aware transformer for overlapping community detection in complex social networks

Aug 2026 · Frontiers in Artificial Intelligence · Vol 9 · 0 citations · 40 references
Medicine

TL;DR

The proposed framework integrates adaptive event-driven graph partitioning, multiscale graph attention encoding, learnable node-centric scale fusion, cross-snapshot link-aware temporal attention, and density-preserving overlap regularization into an adaptive dynamic attention and persistence-aware transformer for overlapping community detection in complex social networks.

Abstract

Overlapping community detection in dynamic complex networks is challenging because memberships evolve over time, interactions arrive irregularly, and genuine bridge roles must be distinguished from noisy multi-community assignments. The aim of this study is to develop and evaluate adaptive dynamic attention and persistence-aware transformer (ADAPT-Net), an adaptive dynamic attention and persistence-aware transformer for overlapping community detection in complex social networks. The proposed framework integrates adaptive event-driven graph partitioning, multiscale graph attention encoding, learnable node-centric scale fusion, cross-snapshot link-aware temporal attention, and density-preserving overlap regularization. The primary controlled evaluation uses one processed benchmark instance derived from the Real-world Dynamic Networks (DynaMo) collection. Under a unified five-fold held-out protocol, ADAPT-Net records an F1-score of 96.70 ± 0.65, precision of 95.75 ± 1.50, recall of 97.69 ± 0.49, Jaccard similarity of 93.62 ± 1.22, Omega Index of 88.91 ± 3.01, normalized mutual information (NMI) of 84.43 ± 2.59, area under the receiver operating characteristic curve (AUC–ROC) of 99.77 ± 0.11, and area under the precision–recall curve (AUPRC) of 99.59 ± 0.17. Additional label-independent structural validation is reported for Reddit, dblp computer science bibliography (DBLP), and Enron using modularity, coverage, conductance, internal density, overlap rate, mean memberships per node, and temporal switch rate. The controlled and external analyses address different questions: the processed DynaMo-derived benchmark instance measures agreement with the reference memberships contained in the evaluation folds, whereas the external networks assess structural cohesion and temporal stability without equivalent reference overlaps. The current implementation is trained offline on snapshot sequences and supports snapshot-level inference rather than fully online parameter updates.

Read PDF

Similar papers

Aug 2026

An event-adaptive incremental framework for transient community detection in temporal networks

A novel evolutionary incremental approach called Event Adaptive Incremental Learning Non-Negative Matrix Factorization (EA-iNMF) is proposed, which integrates event-adaptive learning with an incremental update mechanism to efficiently identify optimal time spans corresponding to peak user engagement.

S. Pahari, Paramita Dey · 0 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
Open access Jul 2026

Community Detection as Adaptive Diffusion

This work introduces ECHO (Encoding Communities via High-Order Operators), a scalable, self-supervised framework that treats communities as regions of adaptive diffusion on semantic manifolds that recovers communities from topology when node features are weak, while feature isolation is preferable when features are str...

Emilio Ferrara · 0 citations
Conference Jul 2026

MACO-MGDT: Overlapping Community Detection in Heterogeneous Networks via Community-Aware Embeddings

The community detection is a basic task of network analysis, which allows identifying clusters of network nodes with rich internal relationships and structural similarity. The classical community detection algorithms usually assume the network is homogeneous and impose hard assignments of clusters, which restricts thei...

N. Vinod, Neha Priyesh, Sreelakshmy A J et al. · 0 citations
Conference Open access Sep 2026

Dual-Channel Hybrid Graph Neural Network for Mobility Social Relationship Inference

A novel Dual-Channel Hybrid Graph Neural Network (HyGNN) that jointly models temporal dynamics and high-order structural dependencies and robustly captures the nonlinear interplay between mobility and sociality.

Liang Chen, Xiang Li, Gui-Yuan Jiang et al. · 0 citations
Jul 2026

Spectradyn: an adaptive spectral-temporal framework for dynamic graph link prediction

SpectraDyN is introduced, a unified framework integrating spectral-temporal modeling that incorporates a wavelet transform layer to achieve multi-resolution decomposition, enabling the distinct capture of both long-term community evolution and short-term event-driven interactions.

Feng Ye, Zia Ullah Khan, Xiao Long et al. · 0 citations

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