An overview of fairness in clustering
Clustering algorithms are a class of unsupervised machine learning (ML) algorithms that
feature ubiquitously in modern data science, and play a key role in many learning-based …
feature ubiquitously in modern data science, and play a key role in many learning-based …
An effective and adaptable K-means algorithm for big data cluster analysis
Tradition K-means clustering algorithm is easy to fall into local optimum, poor clustering
effect on large capacity data and uneven distribution of clustering centroids. To solve these …
effect on large capacity data and uneven distribution of clustering centroids. To solve these …
Fairsna: Algorithmic fairness in social network analysis
In recent years, designing fairness-aware methods has received much attention in various
domains, including machine learning, natural language processing, and information …
domains, including machine learning, natural language processing, and information …
WEIRD FAccTs: How Western, Educated, Industrialized, Rich, and Democratic is FAccT?
Studies conducted on Western, Educated, Industrialized, Rich, and Democratic (WEIRD)
samples are considered atypical of the world's population and may not accurately represent …
samples are considered atypical of the world's population and may not accurately represent …
Fair clustering via equitable group representations
M Abbasi, A Bhaskara… - Proceedings of the 2021 …, 2021 - dl.acm.org
What does it mean for a clustering to be fair? One popular approach seeks to ensure that
each cluster contains groups in (roughly) the same proportion in which they exist in the …
each cluster contains groups in (roughly) the same proportion in which they exist in the …
Algorithmic fairness datasets: the story so far
Data-driven algorithms are studied and deployed in diverse domains to support critical
decisions, directly impacting people's well-being. As a result, a growing community of …
decisions, directly impacting people's well-being. As a result, a growing community of …
Improved approximation algorithms for individually fair clustering
A Vakilian, M Yalciner - International conference on artificial …, 2022 - proceedings.mlr.press
We consider the $ k $-clustering problem with $\ell_p $-norm cost, which includes $ k $-
median, $ k $-means and $ k $-center, under an individual notion of fairness proposed by …
median, $ k $-means and $ k $-center, under an individual notion of fairness proposed by …
Approximation algorithms for socially fair clustering
Y Makarychev, A Vakilian - Conference on Learning Theory, 2021 - proceedings.mlr.press
We present an (e^{O (p)}(log\ell)/(log log\ell))-approximation algorithm for socially fair
clustering with the l_p-objective. In this problem, we are given a set of points in a metric …
clustering with the l_p-objective. In this problem, we are given a set of points in a metric …
Approximation algorithms for fair range clustering
SS Hotegni, S Mahabadi… - … Conference on Machine …, 2023 - proceedings.mlr.press
This paper studies the fair range clustering problem in which the data points are from
different demographic groups and the goal is to pick $ k $ centers with the minimum …
different demographic groups and the goal is to pick $ k $ centers with the minimum …
Approximating fair clustering with cascaded norm objectives
E Chlamtáč, Y Makarychev, A Vakilian - Proceedings of the 2022 annual ACM …, 2022 - SIAM
We introduce the (p, q)-Fair Clustering problem. In this problem, we are given a set of points
P and a collection of different weight functions W. We would like to find a clustering which …
P and a collection of different weight functions W. We would like to find a clustering which …