Child pages
  • SLM Community Detection
Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 6 Next »

Description

Our smart local moving (SLM) algorithm is an algorithm for community detection (or clustering) in large networks. The SLM algorithm maximizes a so-called 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 information.

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

WeightAn integer attribute of the edge that will be used as weight parameter
ResolutionThe resolution parameter determines the granularity level at which communities are detected. Use a value above (below) 1.0 if you want to obtain a larger (smaller) number of communities.
Random StartNumber of random starts
IterationsNumber of iterations per random start
Random SeedSeed of the random number generator

Applications

The directionality of the input network does not matter, so both directed and undirected networks yield the same results.

If the input network has numeric edge attributes, one can be chosen as edge weight. If no edge weight (attribute) is specified, all edges default to having a weight of 1.

The output network will structurally be the same as the input network, but the nodes will be annotated with new attributes labeled "community_level_x", where x is a community level. The value of each of these attributes is the id of a community. 

Implementation Details

A single network is expected as the input, and a single network is produced as the output.

A modified version of the Java implementation of this algorithm is compiled and wrapped for integration into CIShell (see Link and References). This version is modified to accept input from method call rather than console.

To integrate this algorithm in CIShell, a custom (Java) converter is used to convert the input network file to a edge list file that is proprietary to the compiled algorithm. The compiled algorithm is then executed upon this proprietary edge list file. The output community file is merged with the input network to produce the output network with annotations.

Usage Hints

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
References
  1. Ludo Waltman, Nees Jan van Eck, 2013. "A smart local moving algorithm for large-scale modularity-based community detection". Eur. Phys. J. B (2013) 86: 471.
See Also

 

The license could not be verified: License Certificate has expired! Generate a Free license now.
  • No labels