Dynamic community detection based on graph convolutional networks and contrastive learning

Xianghua Li, Xiyuan Zhen, Xin Qi, Huichun Han, Long Zhang and Zhen Han

Chaos, Solitons & Fractals, 2023, vol. 176, issue C

Abstract: With the continuous development of technology and networks, real-life interactions are gradually being abstracted into social networks for study. Social circles are a fundamental structural feature that is prevalent on social networks. Thus, exploring social circle structure plays an important role in revealing the characteristics of complex social networks and provides guidance for understanding social behavior in real life. For example, it can aid in precision marketing, personalized recommendation, and knowledge dissemination within social circles. One of the important means of identifying social network circles lies on community detection algorithms. However, real-world social networks are often dynamic and can be studied and analyzed by building dynamic networks, while existing dynamic network community detection methods tend to ignore the global structure information and time-series information of nodes. To address this problem, this paper proposes a dynamic network community detection algorithm based on graph convolutional neural networks and contrastive learning, which fully captures the adjacent characteristics between nodes based on the correlation information and leverages the feature smoothing strategy to efficiently extract node representations of dynamic networks under unsupervised scenario. Specifically, the proposed algorithm first utilizes node correlation based aggregation strategy to compute the feature matrix for single time-step of the dynamic network. Then, mutual information maximization is implemented based on cross-entropy between learned local and global representations. To reduce the computational overhead in the optimization process, an additional LSTM module is further equipped for updating the parameters of graph convolutional networks in each time-step. Additionally, a contrastive learning based network smoothing strategy is designed to minimize the feature differences between neighboring nodes. Comparative experiments demonstrate that the proposed algorithm achieves excellent performance on both synthetic and real networks.

Keywords: Dynamic networks; Community detection; Graph convolutional neural networks; Contrastive learning (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077923010597
Full text for ScienceDirect subscribers only

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:eee:chsofr:v:176:y:2023:i:c:s0960077923010597

DOI: 10.1016/j.chaos.2023.114157

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().