Research on semi-supervised community discovery algorithm based on new annealing

Research on semi-supervised community discovery algorithm based on new annealing

Based on the similarity of the community detection methods, the Givern-Newman (GN) algorithm is fast and accurate but has a higher running time. In order to improve the efficiency of GN Algorithm, this study presents a semi-supervised GN algorithm based on node similarity. By making full use of the...

Full description

Bibliographic Details
Main Authors: Jinghong Wang, Jiateng Yang, Yichao He
Format: Article
Language:English
Published: Wiley 2020-12-01
Series:The Journal of Engineering
Subjects:
network theory (graphs)
iterative methods
complex networks
graph theory
social network theory
optimisation
must-link constraints
new annealing maximisation algorithm
semisupervised gn algorithm
community detection methods
semisupervised community discovery algorithm
node similarity
similarity information
cannot-link constraints
Online Access:https://digital-library.theiet.org/content/journals/10.1049/joe.2019.1186

Internet

https://digital-library.theiet.org/content/journals/10.1049/joe.2019.1186

Similar Items