Fig. 6From: Anomaly detection and community detection in networksThe network of POLBOOKS (Experiment 2). We show an example output of running the 2-step algorithm where we first detect anomalous edges, then remove them and finally run regular CD on the pruned dataset.) The communities inferred by ACD before removal. The edges inferred by ACD as anomalous edges are shown in red. Here, \(\pi =0.0001, \mu =0.5\). b The communities inferred by CD after removal of anomalies. c Ground truth communities. Red rectangles denote pairs of nodes that are connected by the edges inferred as anomalous. Cyan rectangles demonstrate the nodes that changed their community membership, after removing the aforementioned anomalous edges. Cyan edges in panel (a) present the edges connected to theseBack to article page