Vertex clustering in diverse dynamic networks
Table 1
Average AMI scores (higher is better) of 100 independent runs of various community detection methods over a range of synthetic datasets.
STGkM is our method, CC uses dynamic connected components, k-medoids compresses a dynamic graph into a single static one and uses k-medoids, and DCDID is a heuristic method [4]. The best performance is bolded.