Fair Algorithms for Clustering

01/08/2019

∙

by   Suman K. Bera, et al.

∙

0

∙

share

We study clustering problems under the lens of algorithmic fairness inspired by the disparate impact doctrine. Given a collection of points containing many protected groups, the goal is to find good clustering solutions where each cluster fairly represents each group. We allow the user to specify the parameters that define fair representation, and this flexibility makes our model significantly more general than the recent models of Chierichetti et al. (NIPS 2017) and Rösner and Schmidt (ICALP 2018). Our main result is a simple algorithm that, for any ℓ_p-norm including the k-center, k-median, and k-means objectives, transforms any clustering solution to a fair one with only a slight loss in quality.