A Simple Acceleration Method for the Louvain Algorithm - Volume 8 Number 3 (Jun. 2016) - IJCEE
Volume 8 Number 3 (Jun. 2016)
Home > Archive > 2016 > Volume 8 Number 3 (Jun. 2016) >
IJCEE 2016 Vol.8(3): 207-218 ISSN: 1793-8163
DOI: 10.17706/IJCEE.2016.8.3.207-218

A Simple Acceleration Method for the Louvain Algorithm

Naoto Ozaki, Hiroshi Tezuka, Mary Inaba
Abstract—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.

Index Terms—Community detection, complex networks, Louvain algorithm, Heuristic, pruning.

The authors are with the Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan.

Cite:Naoto Ozaki, Hiroshi Tezuka, Mary Inaba, "A Simple Acceleration Method for the Louvain Algorithm," International Journal of Computer and Electrical Engineering vol. 8, no. 3, pp. 207-218, 2016.

General Information

ISSN: 1793-8163
Frequency: Quarterly
Editor-in-Chief: Prof. Yucong Duan
Abstracting/ Indexing: EI (INSPEC, IET), Ulrich's Periodicals Directory, Google Scholar, EBSCO, ProQuest, and Electronic Journals Library
E-mail: ijcee@iap.org

What's New

  • Aug 06, 2018 News!

    IJCEE Vol. 8, No. 4 - Vol. 9, No. 1 have been indexed by EI (Inspec) Inspec, created by the Institution of Engineering and Tech.!   [Click]

  • Jul 12, 2018 News!

    IJCEE Vol. 10, No. 2 is available online now.   [Click]

  • Apr 02, 2018 News!

    IJCEE Vol. 10, No. 1 is available online now.   [Click]

  • Jan 05, 2018 News!

    IJCEE Vol. 9, No. 2 is available online now.   [Click]

  • Jul 27, 2017 News!

    IJCEE Vol. 9, No. 1 is available online now.   [Click]

  • Read more>>