Attraction-Repulsion clustering with applications to fairness

Abstract

We consider the problem of diversity enhancing clustering, i.e, developing clustering methods which produce clusters that favour diversity with respect to a set of protected attributes such as race, sex, age, etc. In the context of fair clustering, diversity plays a major role when fairness is understood as demographic parity. To promote diversity, we introduce perturbations to the distance in the unprotected attributes that account for protected attributes in a way that resembles attraction-repulsion of charged particles in Physics. These perturbations are defined through dissimilarities with a tractable interpretation. Cluster analysis based on attraction-repulsion dissimilarities penalizes homogeneity of the clusters with respect to the protected attributes and leads to an improvement in diversity. An advantage of our approach, which falls into a pre-processing set-up, is its compatibility with a wide variety of clustering methods and whit non-Euclidean data. We illustrate the use of our procedures with both synthetic and real data and provide discussion about the relation between diversity, fairness, and cluster structure. Our procedures are implemented in an R package freely available at https://github.com/HristoInouzhe/AttractionRepulsionClustering.

35 pages, 11 figures, 5 tables

References in corpus (8)

• Learning Non-Discriminatory Predictors
• Clustering without Over-Representation
• A statistical framework for fair predictive algorithms
• Coresets for Clustering with Fairness Constraints
• Obtaining fairness using optimal transport theory
• Fair Coresets and Streaming Algorithms for Fair k-Means Clustering
• Tuning Fairness by Balancing Target Labels
• Can everyday AI be ethical. Fairness of Machine Learning Algorithms