After the publication of this work [1], we noticed that an incorrect version of Table two (Table 1 here) was published. An incorrect version of Algorithm four (Algorithm 1 here) was also published. The correct versions of Table two and Algorithm four are provided here and have been updated in the original article.
Table 1
Modularity Comparison
Algorithms→
FN
DGA
FD
MSTAB
MMOC
Networks↓
Size↓
Q FN
Q DGA
Q FD
Q MSTAB
(Q Our method)
PhD’s in CS
1882
0.9610
0.9610
0.9295
0.9601
0.9755
Facebook
1899
0.2717
0.2567
0.3751
0.3742
0.3860
SciMet
3084
0.5469
0.5949
0.6146
0.6146
0.6502
US Power Grid
4941
0.9341
0.9358
0.9347
0.9348
0.9587
FN Fast Newman based on a greedy agglomerative method
DGA Modularity optimization based on Danon greedy agglomerative method
FD Fast detection of communities using modularity optimization
MSTAB Modularity based on stability
MMOC Modified Modularity for Overlapping Community Detection (Our method)
×
The publisher apologises for any inconvenience caused.
Anzeige
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
