{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T06:30:08Z","timestamp":1787725808351,"version":"build-2784847793"},"reference-count":38,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T00:00:00Z","timestamp":1787702400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Artif. Intell."],"abstract":"<jats:p>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 \u00b1 0.65, precision of 95.75 \u00b1 1.50, recall of 97.69 \u00b1 0.49, Jaccard similarity of 93.62 \u00b1 1.22, Omega Index of 88.91 \u00b1 3.01, normalized mutual information (NMI) of 84.43 \u00b1 2.59, area under the receiver operating characteristic curve (AUC\u2013ROC) of 99.77 \u00b1 0.11, and area under the precision\u2013recall curve (AUPRC) of 99.59 \u00b1 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.<\/jats:p>","DOI":"10.3389\/frai.2026.1914215","type":"journal-article","created":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T06:04:10Z","timestamp":1787724250000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["ADAPT-Net: an adaptive dynamic attention and persistence-aware transformer for overlapping community detection in complex social networks"],"prefix":"10.3389","volume":"9","author":[{"given":"Gowthami","family":"Vusirikkayala","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Vellore Institute of Technology","place":["Vellore, Tamil Nadu, India"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V.","family":"Madhu Viswanatham","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Vellore Institute of Technology","place":["Vellore, Tamil Nadu, India"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1965","published-online":{"date-parts":[[2026,8,26]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"70129","DOI":"10.1109\/ACCESS.2024.3399883","article-title":"Robust overlapping community detection in complex networks with graph convolutional networks and fuzzy C-means","volume":"12","author":"Al-Andoli","year":"2024","journal-title":"IEEE Access"},{"key":"B2","doi-asserted-by":"publisher","first-page":"122252","DOI":"10.1016\/j.techfore.2022.122252","article-title":"Social media content classification and community detection using deep learning and graph analytics","volume":"188","author":"Ali","year":"2023","journal-title":"Technol. Forecast. Soc. Change"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1800683115","article-title":"Simplicial closure and higher-order link prediction","author":"Benson","year":"2018","journal-title":"Proc. Nat. Acad. Sci"},{"key":"B4","doi-asserted-by":"publisher","first-page":"3444","DOI":"10.1109\/TCSS.2023.3327810","article-title":"A deep semi-supervised community detection based on point-wise mutual information","volume":"11","author":"Berahmand","year":"2024","journal-title":"IEEE Trans. Comput. Soc. Syst"},{"key":"B5","article-title":"How attentive are graph attention networks?","author":"Brody","year":"2022","journal-title":"arXiv"},{"key":"B6","doi-asserted-by":"publisher","first-page":"e2185","DOI":"10.7717\/peerj-cs.2185","article-title":"Two-stage multi-objective evolutionary algorithm for overlapping community discovery","volume":"10","author":"Cai","year":"2024","journal-title":"PeerJ Comput. Sci"},{"key":"B7","doi-asserted-by":"publisher","first-page":"110202","DOI":"10.1016\/j.knosys.2022.110202","article-title":"AC2CD: an actor-critic architecture for community detection in dynamic social networks","volume":"261","author":"Costa","year":"2023","journal-title":"Knowl. Based Syst"},{"key":"B8","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1007\/s42235-022-00303-z","article-title":"An improved Harris Hawks optimization algorithm with multi-strategy for community detection in social network","volume":"20","author":"Gharehchopogh","year":"2023","journal-title":"J. Bionic Eng"},{"key":"B9","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1007\/s12652-018-1108-5","article-title":"A new algorithm for communities detection in social networks with node attributes","volume":"15","author":"Gmati","year":"2024","journal-title":"J. Ambient Intell. Humaniz. Comput"},{"key":"B10","doi-asserted-by":"publisher","first-page":"104816","DOI":"10.1016\/j.knosys.2019.06.024","article-title":"dyngraph2vec: capturing network dynamics using dynamic graph representation learning","volume":"187","author":"Goyal","year":"2020","journal-title":"Knowl. Based Syst"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754","article-title":"node2vec: scalable feature learning for networks","author":"Grover","year":"2016","journal-title":"KDD"},{"key":"B12","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1609\/icwsm.v11i1.14972","article-title":"Loyalty in online communities","volume":"11","author":"Hamilton","year":"2017","journal-title":"Proc. Int. AAAI Conf. Web Soc. Media"},{"key":"B13","doi-asserted-by":"publisher","first-page":"13897","DOI":"10.1007\/s10586-024-04632-y","article-title":"A hybrid multi-objective algorithm based on slime mould algorithm and sine cosine algorithm for overlapping community detection in social networks","volume":"27","author":"Heydariyan","year":"2024","journal-title":"Cluster Comput"},{"key":"B14","doi-asserted-by":"publisher","first-page":"107947","DOI":"10.1016\/j.engappai.2024.107947","article-title":"Community detection algorithm for social network based on node intimacy and graph embedding model","volume":"132","author":"Huang","year":"2024","journal-title":"Eng. Appl. Artif. Intell"},{"key":"B15","doi-asserted-by":"publisher","first-page":"4401","DOI":"10.1109\/TFUZZ.2024.3398591","article-title":"Decayed trust propagation method in multiple overlapping communities for improving consensus under social network group decision making","volume":"32","author":"Ji","year":"2024","journal-title":"IEEE Trans. Fuzzy Syst"},{"key":"B16","doi-asserted-by":"publisher","first-page":"3025","DOI":"10.1109\/TFUZZ.2023.3241062","article-title":"The overlapping community-driven feedback mechanism to support consensus in social network group decision making","volume":"31","author":"Ji","year":"2023","journal-title":"IEEE Trans. Fuzzy Syst"},{"key":"B17","doi-asserted-by":"publisher","first-page":"3693","DOI":"10.1007\/s41060-024-00688-6","article-title":"Graph autoencoder (GAE) for community detection in social networks","volume":"20","author":"Joshi","year":"2025","journal-title":"Int. J. Data Sci. Anal"},{"key":"B18","article-title":"Time2Vec: learning a vector representation of time","author":"Kazemi","year":"2019","journal-title":"arXiv"},{"key":"B19","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.neucom.2023.02.059","article-title":"Determination of influential nodes based on the communities' structure to maximize influence in social networks","volume":"534","author":"Kazemzadeh","year":"2023","journal-title":"Neurocomputing"},{"key":"B20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s13278-025-01480-5","article-title":"Common-neighbor based overlapping community detection in complex networks","volume":"15","author":"Khawaja","year":"2025","journal-title":"Soc. Netw. Anal. Min"},{"key":"B21","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017","journal-title":"arXiv"},{"key":"B22","article-title":"\u201cIntroducing the enron corpus,\u201d","author":"Klimt","year":"2004","journal-title":"Proceedings of the First Conference on Email and Anti-Spam"},{"key":"B23","doi-asserted-by":"publisher","first-page":"3329","DOI":"10.1007\/s11227-022-04767-y","article-title":"Community detection in complex networks using stacked autoencoders and crow search algorithm","volume":"79","author":"Kumar","year":"2023","journal-title":"J. Supercomput"},{"key":"B24","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1109\/TASE.2023.3240335","article-title":"Symmetry and graph bi-regularized non-negative matrix factorization for precise community detection","volume":"21","author":"Liu","year":"2024","journal-title":"IEEE Trans. Autom. Sci. Eng"},{"key":"B25","doi-asserted-by":"publisher","first-page":"7205","DOI":"10.1007\/s10115-024-02201-8","article-title":"Community detection in social networks using machine learning: a systematic mapping study","volume":"66","author":"Nooribakhsh","year":"2024","journal-title":"Knowl. Inf. Syst"},{"key":"B26","doi-asserted-by":"publisher","first-page":"5363","DOI":"10.1609\/aaai.v34i04.5984","article-title":"EvolveGCN: evolving graph convolutional networks for dynamic graphs","volume":"34","author":"Pareja","year":"2020","journal-title":"Proc. AAAI Conf. Artif. Intell"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371845","article-title":"DySAT: deep neural representation learning on dynamic graphs via self-attention networks","author":"Sankar","year":"2020","journal-title":"Proc. 13th ACM Int. Conf. Web Search Data Mining"},{"key":"B28","article-title":"Overlapping community detection with graph neural networks","author":"Shchur","year":"2019","journal-title":"arXiv"},{"key":"B29","doi-asserted-by":"publisher","first-page":"3952","DOI":"10.1038\/s41598-024-84962-4","article-title":"GATFELPA integrates graph attention networks and enhanced label propagation for robust community detection","volume":"15","author":"Tang","year":"2025","journal-title":"Sci. Rep"},{"key":"B30","first-page":"5998","article-title":"Attention is all you need","volume":"30","author":"Vaswani","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst"},{"key":"B31","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2018","journal-title":"arXiv"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433471","article-title":"Overlapping community detection at scale: a nonnegative matrix factorization approach","author":"Yang","year":"2013","journal-title":"Proc. 6th ACM Int. Conf. Web Search Data Mining"},{"key":"B33","first-page":"4800","article-title":"Hierarchical graph representation learning with differentiable pooling","volume":"31","author":"Ying","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst"},{"key":"B34","doi-asserted-by":"publisher","first-page":"67686","DOI":"10.52202\/075280-2960","article-title":"Towards better dynamic graph learning: new architecture and unified library","volume":"36","author":"Yu","year":"2023","journal-title":"Adv. Neural Inf. Process. Syst"},{"key":"B35","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.comcom.2022.12.008","article-title":"Overlapping community detection on complex networks with graph convolutional networks","volume":"199","author":"Yuan","year":"2023","journal-title":"Comput. Commun"},{"key":"B36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2023.02.090","article-title":"Large-scale community detection based on core node and layer-by-layer label propagation","volume":"632","author":"Zhang","year":"2023","journal-title":"Inf. Sci"},{"key":"B37","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.1109\/TEVC.2023.3242051","article-title":"Obfuscating community structure in complex network with evolutionary divide-and-conquer strategy","volume":"27","author":"Zhao","year":"2023","journal-title":"IEEE Trans. Evol. Comput"},{"key":"B38","doi-asserted-by":"publisher","first-page":"1934","DOI":"10.1109\/TKDE.2019.2951419","article-title":"DynaMo: dynamic community detection by incrementally maximizing modularity","volume":"33","author":"Zhuang","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng"}],"container-title":["Frontiers in Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/frai.2026.1914215\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T06:04:12Z","timestamp":1787724252000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/frai.2026.1914215\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,26]]},"references-count":38,"alternative-id":["10.3389\/frai.2026.1914215"],"URL":"https:\/\/doi.org\/10.3389\/frai.2026.1914215","relation":{},"ISSN":["2624-8212"],"issn-type":[{"value":"2624-8212","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,26]]},"article-number":"1914215"}}