Back

G-2016-35

Ascent -- Descent Variable Neighborhood Decomposition search for community detection by modularity maximization

, , and

BibTeX reference

In this paper we propose a new variant of the Variable Neighborhood Decomposition Search (VNDS) heuristic for solving global optimization problems and apply it in detecting clusters in complex community networks. The most used criterion for detecting comunities in networks, despite some recent criticism, is modularity maximization. Experimental results show that the proposed new heuristic outperforms the best algorithms found in the literature.

, 11 pages

Research Axis

Research application

Publication

, , and
Annals of Operations Research, 272(1-2), 273–287, 2019 BibTeX reference