A Community Detection Algorithm Based on NSGA-II

Lishuo Zhang, Qi Wang


The community detection problem is modeled as multi-objective optimization problem, and a classic NSGA-II (nondominated sorting genetic algorithm) is adopted to optimize this problem, which overcomes the resolution problem in the process of modularity density optimization and the parameter adjustment in the process of general modularity density optimization. In this case, a set of Pareto solutions with different partitioning results can be obtained in one time, which can be chosen by the decision maker. Besides that, the crossover and mutation operators take the neighborhood information of the vertices of networks into consideration, which matches up with the property of real world complex networks. The graph based on coding scheme confirms the self-adjustment of the community numbers, rather than sets up in advance. All the experiment results indicate that NSGA-II based algorithm can detect the construction of community effectively.


complex Networks, community detection, modularity density function, NSGA-II, multiobjective evolutionary algorithm

Full Text:


DOI: http://dx.doi.org/10.12928/telkomnika.v14i3A.4411

Article Metrics

Abstract view : 0 times
PDF - 0 times


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120 ext. 4902, Fax: +62 274 564604