Fair Algorithms for Clustering

2019-01-08 · NeurIPS 2019 12 · Suman K. Bera, Deeparnab Chakrabarty, Nicolas J. Flores, Maryam Negahbani

We study the problem of finding low-cost Fair Clusterings in data where each data point may belong to many protected groups. Our work significantly generalizes the seminal work of Chierichetti et.al. (NIPS 2017) as follows. - We allow the user to specify the parameters that define fair representation. More precisely, these parameters define the maximum over- and minimum under-representation of any group in any cluster. - Our clustering algorithm works on any $\ell_p$-norm objective (e.g. $k$-means, $k$-median, and $k$-center). Indeed, our algorithm transforms any vanilla clustering solution into a fair one incurring only a slight loss in quality. - Our algorithm also allows individuals to lie in multiple protected groups. In other words, we do not need the protected groups to partition the data and we can maintain fairness across different groups simultaneously. Our experiments show that on established data sets, our algorithm performs much better in practice than what our theoretical results suggest.

📄 PDF Abstract BibTeX arXiv:1901.02393

Code (1)

nicolasjulioflores/fair_algorithms_for_clustering 공식 구현

Tasks

ClusteringFairness

Fair Clustering Using Antidote Data

2021-06-01 · Anshuman Chhabra, Adish Singla, Prasant Mohapatra

Clustering algorithms are widely utilized for many modern data science applications. This motivates the need to make outputs of clustering algorithms fair. Traditionally, new fair algorithmic variants to clustering algor…

Clustering Fairness

Fair Correlation Clustering

2020-02-06 · Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian

In this paper, we study correlation clustering under fairness constraints. Fair variants of $k$-median and $k$-center clustering have been studied recently, and approximation algorithms using a notion called fairlet deco…

Clustering Combinatorial Optimization Fairness

Robust Fair Clustering: A Novel Fairness Attack and Defense Framework

2022-10-04 · Anshuman Chhabra, Peizhao Li, Prasant Mohapatra, Hongfu Liu

Clustering algorithms are widely used in many societal resource allocation applications, such as loan approvals and candidate recruitment, among others, and hence, biased or unfair model outputs can adversely impact indi…

Adversarial Attack Clustering Fairness graph partitioning

Fair Algorithms for Hierarchical Agglomerative Clustering

2020-05-07 · Anshuman Chhabra, Prasant Mohapatra

Hierarchical Agglomerative Clustering (HAC) algorithms are extensively utilized in modern data science, and seek to partition the dataset into clusters while generating a hierarchical relationship between the data sample…

Clustering Fairness Recommendation Systems

Fairness Degrading Adversarial Attacks Against Clustering Algorithms

2021-10-22 · Anshuman Chhabra, Adish Singla, Prasant Mohapatra

Clustering algorithms are ubiquitous in modern data science pipelines, and are utilized in numerous fields ranging from biology to facility location. Due to their widespread use, especially in societal resource allocatio…