A Comparison of Community Detection Algorithms on Artificial Networks

Creative Commons License

Orman G. K. , Labatut V.

12th International Conference on Discovery Science, Porto, Portugal, 3 - 05 October 2009, vol.5808, pp.242-256 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 5808
  • Doi Number: 10.1007/978-3-642-04747-3_20
  • City: Porto
  • Country: Portugal
  • Page Numbers: pp.242-256
  • Keywords: Complex networks, Community detection, Algorithms comparison, COMPLEX NETWORKS, RANDOM GRAPHS


Community detection has become a very important part in complex networks analysis. Authors traditionally test their algorithms on a few real or artificial networks. Testing on real networks is necessary, but also limited: the considered real networks are usually small, the actual underlying communities are generally not defined objectively, and it is not possible to control their properties. Generating artificial networks makes it possible to overcome these limitations. Until recently though, most works used variations of the classic Erdos-Renyi random model and consequently suffered from the same flaws, generating networks not realistic enough. In this work, we use Lancichinetti et al. model, which is able to generate networks with controlled power-law degree and community distributions, to test some community detection algorithms. We analyze the properties of the generated networks and use the normalized mutual information measure to assess the quality of the results and compare the considered algorithms.