# Fair Clustering Through Fairlets

Flavio ChierichettiRavi KumarSilvio LattanziSergei Vassilvitskii

We study the question of fair clustering under the {\em disparate impact} doctrine, where each protected class must have approximately equal representation in every cluster. We formulate the fair clustering problem under both the $k$-center and the $k$-median objectives, and show that even with two protected classes the problem is challenging, as the optimum solution can violate common conventions---for instance a point may no longer be assigned to its nearest cluster center!.. (read more)

PDF Abstract NeurIPS 2017 PDF NeurIPS 2017 Abstract