Attraction-Repulsion clustering with applications to fairness

04/10/2019
by   Eustasio del Barrio, et al.
0

In the framework of fair learning, we consider clustering methods that avoid or limit the influence of a set of protected attributes, S, (race, sex, etc) over the resulting clusters, with the goal of producing a fair clustering. For this, we introduce perturbations to the Euclidean distance that take into account S in a way that resembles attraction-repulsion in charged particles in Physics and results in dissimilarities with an easy interpretation. Cluster analysis based on these dissimilarities penalizes homogeneity of the clusters in the attributes S, and leads to an improvement in fairness. We illustrate the use of our procedures with both synthetic and real data.

READ FULL TEXT
research
10/11/2019

Fairness in Clustering with Multiple Sensitive Attributes

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

Fairness in Visual Clustering: A Novel Transformer Clustering Approach

Promoting fairness for deep clustering models in unsupervised clustering...
research
05/08/2020

Adversarial Graph Embeddings for Fair Influence Maximization over SocialNetworks

Influence maximization is a widely studied topic in network science, whe...
research
09/26/2022

Deep Fair Clustering via Maximizing and Minimizing Mutual Information

Fair clustering aims to divide data into distinct clusters, while preven...
research
05/08/2021

Protecting Individual Interests across Clusters: Spectral Clustering with Guarantees

Studies related to fairness in machine learning have recently gained tra...
research
06/10/2021

Fair Classification with Adversarial Perturbations

We study fair classification in the presence of an omniscient adversary ...

Please sign up or login with your details

Forgot password? Click here to reset