Open access
Jul 2026
Top-k Diverse Polarized Communities in Signed Networks
The Diverse top-k-pc problem is introduced, which is the first principled formulation of top-k polarized communities with controlled overlap, and a greedy sequential algorithm that solves a generalized eigenvector problem at each step, efficiently discovering diverse polarized pairs.
Francesco Gullo, Domenico Mandaglio, Andrea Tagarelli
· Machine-mediated learning · 0 citations