Parallel Community Detection on Massive Graphs

DOI

10.2991/icmemtc-16.2016.111How to use a DOI?

Keywords

community detection; modularity; parallel computing

Abstract

Community detection groups a network into node sets according to their connections. It is an effective way to understanding and analyzing graph-structured data, such as social networks, collaboration networks, and bioinformatic networks. With the flourishing development of social network applications, it has become more desirable to explore graphs from a community-level view. However, based on sequential algorithms, most existing community detection methods are not suitable for massive graphs. In this paper, we propose a Parallel Community Detection approach, named ParCoDe. Just like the native sequential algorithm, it uses "community modularity" as the metric. The detecting process starts from each single node and performs in a bottom-up way. In order to improve its performance, we propose an approximate solution to accelerate the speed of detection with little loss of accuracy. We have implemented ParCoDe on Giraph. Comprehensive experiments on both real and synthetic datasets demonstrate that ParCoDe is of well scalability and is efficient for community detection.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Bing Tian
PY  - 2016/04
DA  - 2016/04
TI  - Parallel Community Detection on Massive Graphs
BT  - Proceedings of the 2016 3rd International Conference on Materials Engineering, Manufacturing Technology and Control
PB  - Atlantis Press
SP  - 570
EP  - 574
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmemtc-16.2016.111
DO  - 10.2991/icmemtc-16.2016.111
ID  - Tian2016/04
ER  -