A Comparative Analysis of Community Detection Algorithms on Artificial Networks

University of Zurich

Indexed indatacite

Abstract

Many community detection algorithms have been developed to uncover the mesoscopic properties of complex networks. However how good an algorithm is, in terms of accuracy and computing time, remains still open. Testing algorithms on real-world network has certain restrictions which made their insights potentially biased: the networks are usually small, and the underlying communities are not defined objectively. In this study, we employ the Lancichinetti-Fortunato-Radicchi benchmark graph to test eight state-of-the-art algorithms. We quantify the accuracy using complementary measures and algorithms' computing time. Based on simple network properties and the aforementioned results, we provide guidelines that help…

Citation impact

718
total citations
FWCI
40.44
Percentile
100%
References
49
Citations per year

Authors

3

Topics & keywords

Keywords
  • Computer science
  • Benchmark (surveying)
  • Algorithm
  • Dependency (UML)
  • Reliability (semiconductor)
  • Complex network
  • Dependency graph
  • Data mining
No related works found for this paper.