Child pages
  • SLM Community Detection

Versions Compared


  • This line was added.
  • This line was removed.
  • Formatting was changed.

Our The smart local moving (SLM)  community detection algorithm (Waltman & Van Eck, 2011) is an algorithm for performing community detection (or clustering) in large networks. The SLM algorithm maximizes a so-called networks by maximizing a modularity function. The algorithm has been successfully applied to networks with tens of millions of nodes and hundreds of millions of edges. See Links section for more informationSLM  algorithm can be used to detect communities in very large networks within short computing times. The SLM algorithm builds on ideas from the Louvain community detection algorithm proposed by Blondel et al. (2008), but it includes a number of enhancements of this algorithm. Because of these enhancements, the SLM algorithm generally yields higher modularity values, but it also requires more computing time.

Adjust the following parameters to optimize the algorithm (See the paper for more detail):


The output of this algorithm can be visualized well with the Circular Hierarchy visualization or using Gephi.

  • Source Code: Link
  • Original Java implementation: Link
  • Paper: Link