Summary: We consider the following general correlation-clustering problem: given a graph with real edge weights (both positive and negative), partition the vertices into clusters to minimize the total absolute weight of cut positive edges and uncut negative edges. Thus, large positive weights (representing strong correlations between endpoints) encourage those endpoints to belong to a common cluster; large negative weights encourage the endpoints to belong to different clusters; and weights with small absolute value represent little information. In contrast to most clustering problems, correlation clustering specifies neither the desired number of clusters nor a distance threshold for clustering; both of these parameters are effectively chosen to be the best possible by the problem definition.
Correlation clustering was introduced by Bansal, Blum, and Chawla, motivated by both document clustering and agnostic learning. They proved NP-hardness and gave constant-factor approximation algorithms for the special case in which the graph is complete (full information) and every edge has weight \(+1\) or \(-1\). We give an \(O(\log n)\)-approximation algorithm for the general case based on a linear-programming rounding and the “region-growing” technique. We also prove that this linear program has a gap of \(\Omega(\log n)\), and therefore our approximation is tight under this approach. We also give an \(O(r ^{3})\)-approximation algorithm for \(K _{r,r }\)-minor-free graphs. On the other hand, we show that the problem is APX-hard, and any \(o(\log n)\)-approximation would require improving the best approximation algorithms known for minimum multicut.
For the entire collection see [Zbl 1026.00023].