Community detection using parallel genetic algorithms

Yulong Song*, Jianwu Li, Xiao Zhang, Chunxue Liu

*Corresponding author for this work

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

4 Citations (Scopus)

Abstract

The main problem on community detection using traditional genetic algorithms (GA) lies in the slow speed of convergence. This paper attempts to apply parallel genetic algorithms (PGA) to explore community structure in complex networks in order to improve the efficiency of traditional genetic algorithms. Several different designing ways of PGA are discussed and compared. Experimental results based on the GN benchmark networks, LFR benchmark networks, and eight real-world networks, confirm the PGA with coarse-grained-master-slave hybrid model spends less time yet achieves higher accuracy than traditional genetic algorithms.

Original languageEnglish
Title of host publication2012 IEEE 5th International Conference on Advanced Computational Intelligence, ICACI 2012
Pages374-378
Number of pages5
DOIs
Publication statusPublished - 2012
Event2012 IEEE 5th International Conference on Advanced Computational Intelligence, ICACI 2012 - Nanjing, China
Duration: 18 Oct 201220 Oct 2012

Publication series

Name2012 IEEE 5th International Conference on Advanced Computational Intelligence, ICACI 2012

Conference

Conference2012 IEEE 5th International Conference on Advanced Computational Intelligence, ICACI 2012
Country/TerritoryChina
CityNanjing
Period18/10/1220/10/12

Fingerprint

Dive into the research topics of 'Community detection using parallel genetic algorithms'. Together they form a unique fingerprint.

Cite this