A heuristic graph editing approach to correlation clustering with overlap
Correlation clustering seeks a partition of the vertex set of a given graph/network into groups of closely related, or just close enough, vertices so that elements of different groups are not close to each other. The problem has been previously modeled and studied as a graph editing problem, namely Cluster Editing , wh...
Faisal N. Abu-Khzam, Lucas Isenmann, Sergio Thoumi
· Scientific Reports · 0 citations