Noisy extremal optimization
- First Online:
- Cite this article as:
- Lung, R.I., Suciu, M. & Gaskó, N. Soft Comput (2017) 21: 1253. doi:10.1007/s00500-015-1858-3
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.