Parallel Particle Swarm Optimization Algorithm for Identifying Complex Communities in Biological Networks

Abstract

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed to detect complex biological communities with high quality. Secondly, the variability in the capability of PSO to extract community structure in biological networks is studied when different types of crossover operators are used. Finally, to reduce the computational time needed to solve this problem, especially when detecting complex communities in large-scale biological networks, we have implemented parallel computing to execute the algorithm. The performance of the proposed algorithm was tested and evaluated on two real biological networks. The experimental results showed the effective performance of the proposed algorithm when using single-point crossover operator, and its superiority over other counterpart algorithms. Moreover, the use of parallel computing in the proposed algorithm representation has greatly reduced the computational time required for its execution.