Skip to main content
Fig. 1 | Applied Network Science

Fig. 1

From: Ensemble clustering for graphs: comparisons and applications

Fig. 1

In the first two plots, we compare the accuracy of ECG with state-of-the-art algorithms: InfoMap (IM), WalkTrap (WT) and Louvain (ML). Results from each algorithm are compared with the true communities for LFR graphs with n=22,186 nodes, and for various values of μ, the proportion of noisy edges. For each value of μ, we average over 10 LFR graphs; the shaded area shows the standard deviation. We see that ECG outperforms all other algorithms. In the third plot, we look at the ratio of the number of computed vs true communities. We see that ECG remains very close to the desired value \(\hat {C}/C=1\), as opposed to the other algorithms

Back to article page