Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/26161
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZhang, B-
dc.contributor.authorMi, Y-
dc.contributor.authorZhang, L-
dc.contributor.authorZhang, Y-
dc.contributor.authorLi, M-
dc.contributor.authorZhai, Q-
dc.contributor.authorLi, M-
dc.date.accessioned2023-03-19T16:05:34Z-
dc.date.available2023-03-19T16:05:34Z-
dc.date.issued2022-12-13-
dc.identifierORCID iD: Maozhen Li https://orcid.org/0000-0002-0820-5487-
dc.identifier4738-
dc.identifier.citationZhang, B. et al. (2022) 'Dynamic Community Detection Method of a Social Network Based on Node Embedding Representation', Mathematics, 10 (24), 4738, pp. 1 - 22. doi: 10.3390/math10244738.en_US
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/26161-
dc.description.abstractCopyright © 2022 by the authors. 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.en_US
dc.description.sponsorshipNational Natural Science Foundation of China (61802258, 61572326); Natural Science Foundation of Shanghai (18ZR1428300).en_US
dc.format.extent1 - 22-
dc.format.mediumElectronic-
dc.languageEnglish-
dc.language.isoen_USen_US
dc.publisherMDPIen_US
dc.rightsCopyright © 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).-
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/-
dc.subjectgraph neural networken_US
dc.subjectnode embeddingen_US
dc.subjectdynamic community detectionen_US
dc.subjectincrementalen_US
dc.subjectmodularityen_US
dc.titleDynamic Community Detection Method of a Social Network Based on Node Embedding Representationen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.3390/math10244738-
dc.relation.isPartOfMathematics-
pubs.issue24-
pubs.publication-statusPublished-
pubs.volume10-
dc.identifier.eissn2227-7390-
dc.rights.holderThe authors-
Appears in Collections:Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).5.54 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons