A genetic algorithm with local search based on label propagation for detecting dynamic communities

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

Abstract

The interest in community detection problems on networks that evolves over time have experienced an increasing attention over the last years. Genetic Algorithms, and other bio-inspired methods, have been successfully applied to tackle the community finding problem in static networks. However, few research works have been done related to the improvement of these algorithms for temporal domains. This paper is focused on the design, implementation, and empirical analysis of a new Genetic Algorithm pair with a local search operator based on Label Propagation to identify communities on dynamic networks.

Cite

CITATION STYLE

APA

Panizo, A., Bello-Orgaz, G., & Camacho, D. (2018). A genetic algorithm with local search based on label propagation for detecting dynamic communities. In Studies in Computational Intelligence (Vol. 798, pp. 319–328). Springer Verlag. https://doi.org/10.1007/978-3-319-99626-4_28

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