A Simple Acceleration Method for the Louvain Algorithm

The Louvain algorithm is well known for its high speed for detecting community structure in networks. In this paper, first, we analyze the Louvain algorithm as the preliminary experiment to uncover the processes that cause wasted computational time and their characteristics. Then based on this, we propose the Louvain Prune algorithm. The experiments show that the Louvain Prune algorithm significantly reduces computational time by up to 90%, and retains almost the same quality as the original Louvain algorithm.

[1]  Vincent A. Traag,et al.  Faster unfolding of communities: speeding up the Louvain algorithm , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[3]  Tamara G. Kolda,et al.  Accelerating Community Detection by Using K-core Subgraphs , 2014, ArXiv.

[4]  Ludo Waltman,et al.  A smart local moving algorithm for large-scale modularity-based community detection , 2013, The European Physical Journal B.

[5]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[7]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[8]  Andreas Geyer-Schulz,et al.  An ensemble learning strategy for graph clustering , 2012, Graph Partitioning and Graph Clustering.

[9]  Ignacio Marín,et al.  Surprise maximization reveals the community structure of complex networks , 2013, Scientific Reports.

[10]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[11]  Jin-Kao Hao,et al.  Improving the Louvain Algorithm for Community Detection with Modularity Maximization , 2013, Artificial Evolution.

[12]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Viktor K. Prasanna,et al.  Fast parallel algorithm for unfolding of communities in large graphs , 2014, 2014 IEEE High Performance Extreme Computing Conference (HPEC).

[14]  Vincent A. Traag,et al.  Significant Scales in Community Structure , 2013, Scientific Reports.