Few-Shot Community Detection in Graphs via Strong Triadic Closure and Prompt Learning

Yeqin Zhou and Heng Bao ()
Additional contact information
Yeqin Zhou: School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China
Heng Bao: CNCERT/CC, Beijing 100094, China

Mathematics, 2025, vol. 13, issue 19, 1-24

Abstract: Community detection is a fundamental task for understanding network structures, crucial for identifying groups of nodes with close connections. However, existing methods generally treat all connections in networks as equally important, overlooking the inherent inequality of connection strengths in social networks, and often require large quantities of labeled data. To address these challenges, we propose a few-shot community detection framework, S trong T riadic C losure C ommunity D etection with P rompt (STC-CDP), which combines the Strong Triadic Closure (STC) principle, Graph Neural Networks, and prompt learning. The STC principle, derived from social network theory, states that if two nodes share strong connections with a third node, they are likely to be connected with each other. By incorporating STC constraints during the pre-training phase, STC-CDP can differentiate between strong and weak connections in networks, thereby more accurately capturing community structures. We design an innovative prompt learning mechanism that enables the model to extract key features from a small number of labeled communities and transfer them to the identification of unlabeled communities. Experiments on multiple real-world datasets demonstrate that STC-CDP significantly outperforms existing state-of-the-art methods under few-shot conditions, achieving higher F1 scores and Jaccard similarity particularly on Facebook, Amazon, and DBLP datasets. Our approach not only improves the precision of community detection but also provides new insights into understanding connection inequality in social networks.

Keywords: community detection; Strong Triadic Closure; prompt learning; few-shot learning; Graph Neural Networks (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/19/3083/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/19/3083/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:19:p:3083-:d:1757925

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().