GA-LP

GA-LP presented results competitive with the current literature.GA-LP refines the results of the well-known Label Propagation.The time to detect communities in large directed networks by GA-LP is very low. Many real-world networks have a topological structure characterized by cohesive groups of vertices. To perform the task of identifying such subsets of vertices, community detection in networks has aroused the interest of researchers and practitioners alike. In spite of the existence of various efficient community detection algorithms in the literature, most of them uses global information about the network, not applicable to distributed networks. This paper proposes a genetic-based algorithm to detect communities in directed networks based on local information to generate the offspring. The major difference between the proposed strategy and those found in the literature is the way of exploiting target regions of interest in the solution space. This step is directly influenced by the crossover operator that depends largely on the individual representation. In the introduced strategy, GA-LP, the individual is locally stored in the vertices as labels, what brings more flexibility in the system to be adapted to address applications that involve, for example, dynamic networks. In computational experiments, the proposed strategy showed an outstanding performance, being fast, achieving the best results on average in the networks tested.