Node Splitting Based Overlapping Community Detection Framework in MapReduce

Abstract

This paper proposes implementations of community structure detection algorithms in MapReduce, a parallel programming framework. One of the community detection algorithms we have implemented in MapReduce is the Peacock algorithm, which pre-filters nodes likely to be a member of more than one community. These nodes are copied by the number of communities they might belong to. The actual communities are found in the next step, and Peacock algorithms modular nature allows for its use with other community detection algorithms, specifically those that cannot detect overlapping communities. We show performance differences of two disjoint community detection algorithms used in tandem with Peacock: the Girvan-Newman and fast unfolding algorithms. We demonstrate on a real world social network dataset that MapReduce increases scalability of the algorithms.