Fig. 10
From: Ensemble clustering for graphs: comparisons and applications
We compare three flavours of the CADA algorithm using InfoMap (IM), Louvain (ML) and ECG. For each value of.3≤μ≤.75, we generated 10 LFR graphs of size 22,186, along with 200 random anomalous nodes with the same degree distribution. We considered 5 different choices for the LFR power law exponents. Results are compared via the area under the ROC curve (AUC)