Community finding algorithm GN algorithm
2016-08-23
0 0 0
no vote
Other
Earn points
GN algorithm is a classic community discovery algorithm, which belongs to hierarchical clustering algorithm to split, initially, by Michelle Girvan and Mark Newman made. The basic idea is to delete the network constantly with respect to the maximum number of referrals (ege betweenness) side edges of all of the source node, and then re-calculate the network edge with the remaining edge betweenness for all source nodes, repeat this process until the network, all edges are removed.
c++
算法
社区
发现
GN
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
No comment