Benchmark graphs for testing community detection algorithms.

@article{Lancichinetti2008BenchmarkGF,
  title={Benchmark graphs for testing community detection algorithms.},
  author={Andrea Lancichinetti and Santo Fortunato and Filippo Radicchi},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2008},
  volume={78 4 Pt 2},
  pages={
          046110
        }
}
Community structure is one of the most important features of real networks and reveals the internal organization of the nodes. Many algorithms have been proposed but the crucial issue of testing, i.e., the question of how good an algorithm is, with respect to others, is still open. Standard tests include the analysis of simple artificial graphs with a built-in community structure, that the algorithm has to recover. However, the special graphs adopted in actual tests have a structure that does… 

Figures from this paper

Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities.

The basic ideas behind the previous benchmark are extended to generate directed and weighted networks with built-in community structure, and the possibility that nodes belong to more communities is considered, a feature occurring in real systems, such as social networks.

Exploring the limits of community detection strategies in complex networks

It is shown that none of the community detection algorithms tested provide consistently optimal results in all networks and that Surprise maximization, obtained by combining multiple algorithms, obtains quasi-optimal performances in these difficult benchmarks.

Topology of Complex Networks and Performance Limitations of Community Detection Algorithms

This paper uses the well-known Lancichinetti–Fortunato–Radicchi (LFR) model and proposes a new model named Naïve Scale-Free Clustering to avoid any bias that can be introduced by the underlying network generation model.

A Comparative Analysis of Community Detection Algorithms on Artificial Networks

This study uses the Lancichinetti-Fortunato-Radicchi benchmark graph to test eight state-of-the-art community detection algorithms and provides guidelines that help to choose the most adequate community detection algorithm for a given network.

Community detection algorithms: a comparative analysis.

Three recent algorithms introduced by Rosvall and Bergstrom and Ronhovde and Nussinov have an excellent performance, with the additional advantage of low computational complexity, which enables one to analyze large systems.

Community detection algorithms: a comparative analysis: invited presentation, extended abstract

Three recent algorithms introduced by Rosvall and Bergstrom, Blondel et al. and Ronhovde and Nussinov have an excellent performance, with the additional advantage of low computational complexity, which enables one to analyze large systems.

Correlation Analysis of Nodes Identifies Real Communities in Networks

A simple and effective algorithm that uses the correlation of nodes alone, which requires neither optimization of predefined objective function nor information about the number or sizes of communities is proposed.

Closed benchmarks for network community structure characterization

  • R. AldecoaI. Marín
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2012
A type of benchmark is presented, in which an initial network of known community structure is progressively converted into a second network whose communities are also known, which makes it a general standard for comparing community detection algorithms.

Finding Statistically Significant Communities in Networks

OSLOM (Order Statistics Local Optimization Method), the first method capable to detect clusters in networks accounting for edge directions, edge weights, overlapping communities, hierarchies and community dynamics, is presented.

Community Detection in Networks

This project explores the use of Genetic Algorithms (GAs) in solving the problem of detecting and extracting communities from such graphs and designed a new GA-based algorithm for the problem.
...

References

SHOWING 1-10 OF 30 REFERENCES

Phys

  • Rev. Lett. 93, 218701
  • 2004

技術解説 IEEE Computer

Phys. Rev. E

  • Phys. Rev. E
  • 2004

Proc

  • Natl. Acad. Sci. 99, 7821
  • 2002

SIAM Review 45

  • 167
  • 2003

Phys. Rep

  • Phys. Rep
  • 2006

Phys

  • Rev. E 70, 066111
  • 2004

Phys. Rev. E

  • Phys. Rev. E
  • 2004

Phys. Rev. E

  • Phys. Rev. E
  • 2003