Better Algorithms for Individually Fair k-Clustering

06/23/2021
by   Deeparnab Chakrabarty, et al.
0

We study data clustering problems with ℓ_p-norm objectives (e.g. k-Median and k-Means) in the context of individual fairness. The dataset consists of n points, and we want to find k centers such that (a) the objective is minimized, while (b) respecting the individual fairness constraint that every point v has a center within a distance at most r(v), where r(v) is v's distance to its (n/k)th nearest point. Jung, Kannan, and Lutz [FORC 2020] introduced this concept and designed a clustering algorithm with provable (approximate) fairness and objective guarantees for the ℓ_∞ or k-Center objective. Mahabadi and Vakilian [ICML 2020] revisited this problem to give a local-search algorithm for all ℓ_p-norms. Empirically, their algorithms outperform Jung et. al.'s by a large margin in terms of cost (for k-Median and k-Means), but they incur a reasonable loss in fairness. In this paper, our main contribution is to use Linear Programming (LP) techniques to obtain better algorithms for this problem, both in theory and in practice. We prove that by modifying known LP rounding techniques, one gets a worst-case guarantee on the objective which is much better than in MV20, and empirically, this objective is extremely close to the optimal. Furthermore, our theoretical fairness guarantees are comparable with MV20 in theory, and empirically, we obtain noticeably fairer solutions. Although solving the LP exactly might be prohibitive, we demonstrate that in practice, a simple sparsification technique drastically improves the run-time of our algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2021

Improved Approximation Algorithms for Individually Fair Clustering

We consider the k-clustering problem with ℓ_p-norm cost, which includes ...
research
02/17/2020

(Individual) Fairness for k-Clustering

We give a local search based algorithm for k-median (k-means) clustering...
research
02/10/2019

Scalable Fair Clustering

We study the fair variant of the classic k-median problem introduced by ...
research
06/20/2019

Coresets for Clustering with Fairness Constraints

In a recent work, Chierichetti et al. studied the following "fair" varia...
research
01/24/2019

Fair k-Center Clustering for Data Summarization

In data summarization we want to choose k prototypes in order to summari...
research
12/04/2022

Can Evolutionary Clustering Have Theoretical Guarantees?

Clustering is a fundamental problem in many areas, which aims to partiti...
research
02/27/2019

Reconciliation k-median: Clustering with Non-Polarized Representatives

We propose a new variant of the k-median problem, where the objective fu...

Please sign up or login with your details

Forgot password? Click here to reset