MPI based distributed memory implementation of Louvain method for non overlapping community detecction
C++ C Shell Java Python Objective-C
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
conf
data/graphs
opt
src
GeneralInstallationGuide.md
LICENSE
QuickStart.md
README.md

README.md

Overview

Communities play an important role throughout the modern world and arise in numerous scenarios ranging from traffic monitoring to identifying criminal activity cells in social networks. Most interconnected datasets exhibit clusters of strongly interconnected data. Our parallel Louvain algorithm helps uncover accurate communities many times faster than the original sequential code. This makes it suitable for environments where data is distributed geographically besides centralized high performance clusters.

Objectives

The objectives of this algorithm are two folded:

  • Quickly unfold highly accurate communities on large potentially distributed graphs
  • Allow a hierarchical view of the communities which enables several levels of detail depending on the needed granularity, e.g., individual level, city level, country level

Benefits

The algorithm is beneficial to data scientists seeking fast community discovery and analysis on geographically distributed datasets at various levels of detail.

Measures of effectiveness

The algorithm has been tested using MPI on an HPC cluster consisting of 16 nodes with 8 cores per node. Each node consisted of two Quad-core AMD Opteron 2376 2.3GHz processors. Speed-ups of up to 6x have been observed for synthetic community graphs consisting of up to 16M vertices and 60M edges.

Required Skill Sets

  • To use the algorithm on a given data set:

  • Required

  • Familiarity with Linux

  • Manipulating graph data (potentially to convert the given data to the Metis graph format)

  • Ability to run MPI programs on a single node or cluster depending on graph size

  • Good to have

  • To use the quick start guide, familiarity with Virtual Box and virtualization

  • C++

  • MPI Library

  • To setup the environment on a cluster

  • Cluster administration knowledge

  • Setting up MPI environment on cluster

How to get it

The algorithm is hosted at the git hub repository at https://github.com/usc-cloud/parallel-louvain-modularity

Clone the repository using

git clone https://github.com/usc-cloud/parallel-louvain-modularity.git

Note: You may need to install a git client to download the repository.

MapReduce version

Given the wide spread adoption of the cloud based frameworks a Map Reduce version of the proposed algorithm was implemented as well and is available here

Installation

A quick start guide can be found here together with a precompiled VM to help you get started.

A detailed guide on how to install the software on a distributed setup can be found here.