Skip to main navigation Skip to search Skip to main content

A parallel algorithm to find overlapping community structure in directed and weighted complex networks

  • Jianping Zhang*
  • , Sheng Ge
  • *Corresponding author for this work
  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Based on the BSP (Bulk Synchronous Parallel) computing framework, this paper proposes a parallel algorithm to find overlapping community structure in directed and weighted complex networks. The algorithm is composed of four parts, job distribution, finding natural communities, passing information in cluster and merging the similar natural communities. The main idea of the algorithm is finding the local maxima of a modularity function by local, iterative search to ensure that each vertex in network at least belongs to one natural community. By iteratively merging the similar natural communities we get a series of schemes and choose the scheme which results in the maximum modularity as the best scheme. By using Hama which is a pure BSP computing framework, we conduct experiments in several real networks. The results show the algorithm can give an original scheme very fast and give the best scheme with high accuracy.

Original languageEnglish
Title of host publicationProceedings of the 2012 2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2012
Pages1561-1564
Number of pages4
DOIs
StatePublished - 2012
Event2012 2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2012 - Harbin, Heilongjiang, China
Duration: 8 Dec 201210 Dec 2012

Publication series

NameProceedings of the 2012 2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2012

Conference

Conference2012 2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control, IMCCC 2012
Country/TerritoryChina
CityHarbin, Heilongjiang
Period8/12/1210/12/12

Keywords

  • BSP
  • Community structure
  • Directed and weighted complex network
  • Overlapping

Fingerprint

Dive into the research topics of 'A parallel algorithm to find overlapping community structure in directed and weighted complex networks'. Together they form a unique fingerprint.

Cite this