###### Options

# Robust correlation clustering

Date Issued

01-09-2019

Author(s)

Devvrit,

Krishnaswamy, Ravishankar

Rajaraman, Nived

Abstract

In this paper, we introduce and study the Robust-Correlation-Clustering problem: given a graph G = (V, E) where every edge is either labeled + or − (denoting similar or dissimilar pairs of vertices), and a parameter m, the goal is to delete a set D of m vertices, and partition the remaining vertices V \ D into clusters to minimize the cost of the clustering, which is the sum of the number of + edges with end-points in different clusters and the number of − edges with end-points in the same cluster. This generalizes the classical Correlation-Clustering problem which is the special case when m = 0. Correlation clustering is useful when we have (only) qualitative information about the similarity or dissimilarity of pairs of points, and Robust-Correlation-Clustering equips this model with the capability to handle noise in datasets. In this work, we present a constant-factor bi-criteria algorithm for Robust-CorrelationClustering on complete graphs (where our solution is O(1)-approximate w.r.t the cost while however discarding O(1)m points as outliers), and also complement this by showing that no finite approximation is possible if we do not violate the outlier budget. Our algorithm is very simple in that it first does a simple LP-based pre-processing to delete O(m) vertices, and subsequently runs a particular Correlation-Clustering algorithm ACNAlg [2] on the residual instance. We then consider general graphs, and show (O(log n), O(log2 n)) bi-criteria algorithms while also showing a hardness of αMC on both the cost and the outlier violation, where αMC is the lower bound for the Minimum-Multicut problem.

Volume

145