2013Unpublished venueRequires access

An Improved Genetic Algorithm Based on Local Modularity for Community Detection in Complex Network

Xinwu Yang, Rui Li

Open publisher page 3 citations

Abstract

Community detection has been an issue in complex network research. In the paper, according to the definition of weak community, we firstly propose a local modularity and then design a new mutation operator with better efficiency based on local modularity. The mutation operator selects the neighbor node that can best embody the definition of weak community structures as mutated result, which makes the mutated candidate solution closer to the optimal solution. Furthermore, to accelerate the emergence of the optimal solution, the roulette selection is integrated into a uniform crossover operator. On the basis of the above works, an improved Genetic Algorithm based on the local modularity (IGALM) is presented for Community detection. The proposed algorithm is tested and compared to the other algorithms on both computer-generated network and real-world networks. The comparative experimental results reflect that the new algorithm is feasible and effective in small and large scale complex networks.

About this research paper

What this paper is about

Community detection has been an issue in complex network research. In the paper, according to the definition of weak community, we firstly propose a local modularity and then design a new mutation operator with better efficiency based on local modularity. The mutation operator selects the neighbor node that can best embody the definition of weak community structures as mutated result, which makes the mutated candidate solution closer to the optimal solution. Furthermore, to accelerate the emergence of the optimal solution, the roulette selection is integrated into a uniform crossover operator. On the basis of the above works, an improved Genetic Algorithm based on the local modularity (IGALM) is presented for Community detection. The proposed algorithm is tested and compared to the other algorithms on both computer-generated network and real-world networks. The comparative experimental results reflect that the new algorithm is feasible and effective in small and large scale complex networks.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Community detection has been an issue in complex network research. In the paper, according to the definition of weak community, we firstly propose a local modularity and then design a new mutation operator with better efficiency based on local modularity. The mutation operator selects the neighbor node that can best embody the definition of weak community structures as mutated result, which makes the mutated candidate solution closer to the optimal solution. Furthermore, to accelerate the emergence of the optimal solution, the roulette selection is integrated into a uniform crossover operator. On the basis of the above works, an improved Genetic Algorithm based on the local modularity (IGALM) is presented for Community detection. The proposed algorithm is tested and compared to the other algorithms on both computer-generated network and real-world networks. The comparative experimental results reflect that the new algorithm is feasible and effective in small and large scale complex networks.

Key concepts: Modularity (biology), Crossover, Computer science, Operator (biology), Mutation, Genetic algorithm, Node (physics), Roulette

Related papers

Back to paper searchBrowse research topicsOriginal source
An Improved Genetic Algorithm Based on Local Modularity for Community Detection in Complex Network — Research Paper | ScholarLens