F. Temprano Garcia, J. Puerto Albandoz, A. M. Rodríguez-Chía, S. Benati
We present a general methodology using mathematical optimization to identify overlapping communities in complex networks by maximizing aspiration criteria based on extensions of the Newman and Girvan modularity function. We provide mathematical programming formulations both for a new proposed modularity function and for the extended modularity function by Zhang et al. (2007) to find optimal overlapping communities for small to medium size networks. We also develop a heuristic algorithm for the new proposed modularity function valid for large networks. Experimental results indicate, on the one hand, that optimizing the extended modularity function proposed by Zhang et al. (2007) may produce senseless communities and on the other hand, our results show that the new modularity function is eficient at detecting good clusterings with overlapping.
Palabras clave: Complex networks, Overlapping community detection, Modularity, Mathematical programming
Programado
GT01 Localización I. Applications
7 de junio de 2022 16:50
A15
