A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Overlapping community detection is progressively becoming an important issue in complex networks. Many in-memory overlapping community detection algorithms have been proposed for graphs with thousands of nodes. However, analyzing massive graphs with millions of nodes is impossible for the traditional algorithm. In this paper, we propose MR-ECOCD, a novel distributed computation algorithm using MapReduce to detect overlapping communities efficiently on large-scale network. Firstly, thedoi:10.24507/ijicic.12.01.263 fatcat:p3vs5vmx4bfhlheeut2tmvcgt4