Multiobjective genetic method for community discovery in complex networks

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The problem of community structure discovery in complex networks has become one of the hot spots in recent years. This paper proposes a multiobjective genetic algorithm MOGCM to uncover community structure. This method overcomes the limitations of the community detection problems, choosing MinMaxCut and the community fitness as the objective functions. In the experiments, 2 well-known real-life networks are used to validate the performance and the results show that the method successfully detects the communities and it is competitive with state-of-the-art approaches.

Cite

CITATION STYLE

APA

Liu, B., Wang, C., & Wang, C. (2014). Multiobjective genetic method for community discovery in complex networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8794, 404–413. https://doi.org/10.1007/978-3-319-11857-4_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free