Fair Correlation Clustering

by   Sara Ahmadian, et al.

In this paper, we study correlation clustering under fairness constraints. Fair variants of k-median and k-center clustering have been studied recently, and approximation algorithms using a notion called fairlet decomposition have been proposed. We obtain approximation algorithms for fair correlation clustering under several important types of fairness constraints. Our results hinge on obtaining a fairlet decomposition for correlation clustering by introducing a novel combinatorial optimization problem. We show how this problem relates to k-median fairlet decomposition and how this allows us to obtain approximation algorithms for a wide range of fairness constraints. We complement our theoretical results with an in-depth analysis of our algorithms on real graphs where we show that fair solutions to correlation clustering can be obtained with limited increase in cost compared to the state-of-the-art (unfair) algorithms.


page 1

page 2

page 3

page 4


A New Notion of Individually Fair Clustering: α-Equitable k-Center

Clustering is a fundamental problem in unsupervised machine learning, an...

Fair Correlation Clustering in Forests

The study of algorithmic fairness received growing attention recently. T...

Maximizing coverage while ensuring fairness: a tale of conflicting objective

Ensuring fairness in computational problems has emerged as a key topic d...

New Approximation Algorithms for Fair k-median Problem

The fair k-median problem is one of the important clustering problems. T...

Fair Clustering Using Antidote Data

Clustering algorithms are widely utilized for many modern data science a...

Approximation algorithms for stochastic clustering

We consider stochastic settings for clustering, and develop provably-goo...

Please sign up or login with your details

Forgot password? Click here to reset