A Comparison of Community Detection Algorithms on Artificial Networks

  • Günce Keziban Orman
  • Vincent Labatut
Conference paper

DOI: 10.1007/978-3-642-04747-3_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5808)
Cite this paper as:
Orman G.K., Labatut V. (2009) A Comparison of Community Detection Algorithms on Artificial Networks. In: Gama J., Costa V.S., Jorge A.M., Brazdil P.B. (eds) Discovery Science. DS 2009. Lecture Notes in Computer Science, vol 5808. Springer, Berlin, Heidelberg

Abstract

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 Erdős-Rényi 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.

Keywords

Complex networks Community detection Algorithms comparison 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Günce Keziban Orman
    • 1
    • 2
  • Vincent Labatut
    • 1
  1. 1.Computer Science DepartmentGalatasaray UniversityOrtaköy/İstanbulTurkey
  2. 2.TÜBİTAKGebze/KocaeliTurkey

Personalised recommendations