Community Detection Based on Modularity Density and Genetic Algorithm
Jinxia Liu, Jinachao Zeng
Abstract
Jinxia Liu, Jinachao Zeng
Abstract
Detecting and characterizing the community structure of complex network and social network is fundamental problem. Many of the proposed algorithm for detecting community based on modularity Q which fail to identify modules smaller than a scale community. In this paper, authors propose a new community detection algorithm based on genetic algorithm and modularity density (D value). We test our method on classical social networks whose community structure is already known and the results can be much easier compared with the method. Experiments show the capability of the method to successfully detect the community structure.
OpenAlex reports 17 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Detecting and characterizing the community structure of complex network and social network is fundamental problem. Many of the proposed algorithm for detecting community based on modularity Q which fail to identify modules smaller than a scale community. In this paper, authors propose a new community detection algorithm based on genetic algorithm and modularity density (D value). We test our method on classical social networks whose community structure is already known and the results can be much easier compared with the method. Experiments show the capability of the method to successfully detect the community structure.
Key concepts: Modularity (biology), Community structure, Clique percolation method, Computer science, Complex network, Genetic algorithm, Data mining, Algorithm