Towards Fair Deep Clustering With Multi-State Protected Variables

01/29/2019
by   Bokun Wang, et al.
0

Fair clustering under the disparate impact doctrine requires that population of each protected group should be approximately equal in every cluster. Previous work investigated a difficult-to-scale pre-processing step for k-center and k-median style algorithms for the special case of this problem when the number of protected groups is two. In this work, we consider a more general and practical setting where there can be many protected groups. To this end, we propose Deep Fair Clustering, which learns a discriminative but fair cluster assignment function. The experimental results on three public datasets with different types of protected attribute show that our approach can steadily improve the degree of fairness while only having minor loss in terms of clustering quality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2022

Fair Representation Clustering with Several Protected Classes

We study the problem of fair k-median where each cluster is required to ...
research
09/02/2021

Efficient Algorithms For Fair Clustering with a New Fairness Notion

We revisit the problem of fair clustering, first introduced by Chieriche...
research
02/15/2018

Fair Clustering Through Fairlets

We study the question of fair clustering under the disparate impact doc...
research
05/07/2020

Fair Algorithms for Hierarchical Agglomerative Clustering

Hierarchical Agglomerative Clustering (HAC) algorithms are extensively u...
research
06/06/2019

Fair Division Without Disparate Impact

We consider the problem of dividing items between individuals in a way t...
research
06/24/2018

Equalizing Financial Impact in Supervised Learning

Notions of "fair classification" that have arisen in computer science ge...
research
04/25/2021

Fair-Capacitated Clustering

Traditionally, clustering algorithms focus on partitioning the data into...

Please sign up or login with your details

Forgot password? Click here to reset