Fair Clustering via Hierarchical Fair-Dirichlet Process

05/27/2023
by   Abhisek Chakraborty, et al.
0

The advent of ML-driven decision-making and policy formation has led to an increasing focus on algorithmic fairness. As clustering is one of the most commonly used unsupervised machine learning approaches, there has naturally been a proliferation of literature on fair clustering. A popular notion of fairness in clustering mandates the clusters to be balanced, i.e., each level of a protected attribute must be approximately equally represented in each cluster. Building upon the original framework, this literature has rapidly expanded in various aspects. In this article, we offer a novel model-based formulation of fair clustering, complementing the existing literature which is almost exclusively based on optimizing appropriate objective functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2019

Fairness in Clustering with Multiple Sensitive Attributes

A clustering may be considered as fair on pre-specified sensitive attrib...
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/22/2023

Fair Correlation Clustering in Forests

The study of algorithmic fairness received growing attention recently. T...
research
06/10/2020

Fair Clustering for Diverse and Experienced Groups

The ability for machine learning to exacerbate bias has led to many algo...
research
06/18/2020

Fair Hierarchical Clustering

As machine learning has become more prevalent, researchers have begun to...
research
05/27/2022

Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost

Clustering is a fundamental building block of modern statistical analysi...
research
10/11/2020

Representativity Fairness in Clustering

Incorporating fairness constructs into machine learning algorithms is a ...

Please sign up or login with your details

Forgot password? Click here to reset