Dynamic Community Detection Method of a Social Network Based on Node Embedding Representation

Bo Zhang, Yifei Mi, Lele Zhang, Yuping Zhang, Maozhen Li, Qianqian Zhai and Meizi Li ()
Additional contact information
Bo Zhang: College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China
Yifei Mi: College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China
Lele Zhang: College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China
Yuping Zhang: College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China
Maozhen Li: College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China
Qianqian Zhai: College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China
Meizi Li: College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China

Mathematics, 2022, vol. 10, issue 24, 1-22

Abstract: The node embedding method enables network structure feature learning and representation for social network community detection. However, the traditional node embedding method only focuses on a node’s individual feature representation and ignores the global topological feature representation of the network. Traditional community detection methods cannot use the static node vector from the traditional node embedding method to calculate the dynamic features of the topological structure. In this study, an incremental dynamic community detection model based on a graph neural network node embedding representation is proposed, comprising the following aspects. A node embedding model based on influence random walk improves the information enrichment of the node feature vector representation, which improves the performance of the initial static community detection, whose results are used as the original structure of dynamic community detection. By combining a cohesion coefficient and ordinary modularity, a new modularity calculation method is proposed that uses an incremental training method to obtain node vector representation to detect a dynamic community from the perspectives of coarse- and fine-grained adjustments. A performance analysis based on two dynamic network datasets shows that the proposed method performs better than benchmark algorithms based on time complexity, community detection accuracy, and other indicators.

Keywords: graph neural network; node embedding; dynamic community detection; incremental; modularity (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/24/4738/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/24/4738/ (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:10:y:2022:i:24:p:4738-:d:1002416

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 ().