Noisy extremal optimization
- 143 Downloads
Noisy extremal optimization is a new optimization-based heuristic designed to identify the community structure of complex networks by maximizing the modularity function. The extremal optimization algorithm evolves configurations that represent network covers, composed of nodes evaluated separately. Each iteration, a number of nodes having the worst fitness values are randomly assigned different communities. A network shifting procedure is used to induce a noise in the population as a diversity preserving mechanism. Numerical experiments, performed on synthetic and real-world networks, illustrate the potential of this approach.
- Boettcher S, Percus AG (2003) Extremal optimization: an evolutionary local-search algorithm. In: Computational modeling and problem solving in the networked world. Springer US, pp 61–77Google Scholar
- Grappiolo C, Togelius J, Yannakakis GN (2013) Shifting niches for community structure detection. In: 2013 IEEE congress on evolutionary computation (CEC), pp 111–118. IEEEGoogle Scholar
- Honghao C, Zuren F, Zhigang R (2013) Community detection using ant colony optimization. In: 2013 IEEE congress on evolutionary computation (CEC), pp 3072–3078Google Scholar
- Lung RI, Gog A, Chira C (2011) A game theoretic approach to community detection in social networks. In: Nature inspired cooperative strategies for optimization, NICSO 2011, Cluj-Napoca, Romania October 20–22 (2011), pp 121–131Google Scholar
- Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123Google Scholar