Fair clustering via equitable group representations
Mohsen Abbasi, Aditya Bhaskara, Suresh Venkatasubramanian

TL;DR
This paper introduces a new fairness concept for clustering called group-representative clustering, ensuring cluster centers fairly represent different groups, and provides algorithms and empirical validation for this approach.
Contribution
It formalizes the notion of group-representative clustering, drawing parallels with classification fairness, and develops approximation algorithms with empirical evaluation.
Findings
Group-representative clustering aligns with fairness principles in classification.
Proposed algorithms effectively compute fair cluster centers.
Empirical results demonstrate practical viability on real datasets.
Abstract
What does it mean for a clustering to be fair? One popular approach seeks to ensure that each cluster contains groups in (roughly) the same proportion in which they exist in the population. The normative principle at play is balance: any cluster might act as a representative of the data, and thus should reflect its diversity. But clustering also captures a different form of representativeness. A core principle in most clustering problems is that a cluster center should be representative of the cluster it represents, by being "close" to the points associated with it. This is so that we can effectively replace the points by their cluster centers without significant loss in fidelity, and indeed is a common "use case" for clustering. For such a clustering to be fair, the centers should "represent" different groups equally well. We call such a clustering a group-representative clustering.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
