HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Evaluating Community Detection Algorithms for Progressively Evolving Graphs

Abstract : Many algorithms have been proposed in the last ten years for the discovery of dynamic communities. However, these methods are seldom compared between themselves. In this article, we propose a generator of dynamic graphs with planted evolving community structure, as a benchmark to compare and evaluate such algorithms. Unlike previously proposed benchmarks, it is able to specify any desired evolving community structure through a descriptive language, and then to generate the corresponding progressively evolving network. We empirically evaluate six existing algorithms for dynamic community detection in terms of instantaneous and longitudinal similarity with the planted ground truth, smoothness of dynamic partitions, and scalability. We notably observe different types of weaknesses depending on their approach to ensure smoothness, namely Glitches, Oversimplification and Identity loss. Although no method arises as a clear winner, we observe clear differences between methods, and we identified the fastest, those yielding the most smoothed or the most accurate solutions at each step.
Complete list of metadata

Contributor : Remy Cazabet Connect in order to contact the contributor
Submitted on : Thursday, March 18, 2021 - 4:00:50 PM
Last modification on : Thursday, April 7, 2022 - 3:44:28 PM


Files produced by the author(s)



Rémy Cazabet, Souâad Boudebza, Giulio Rossetti. Evaluating Community Detection Algorithms for Progressively Evolving Graphs. Journal of Complex Networks, Oxford University Press, 2020, 8 (6), ⟨10.1093/comnet/cnaa027⟩. ⟨hal-03173685⟩



Record views


Files downloads