An overview of fairness in clustering

A Chhabra, K Masalkovaitė, P Mohapatra - IEEE Access, 2021 - ieeexplore.ieee.org
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 …

An effective and adaptable K-means algorithm for big data cluster analysis

H Hu, J Liu, X Zhang, M Fang - Pattern Recognition, 2023 - Elsevier
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 …

Fairsna: Algorithmic fairness in social network analysis

A Saxena, G Fletcher, M Pechenizkiy - ACM Computing Surveys, 2024 - dl.acm.org
In recent years, designing fairness-aware methods has received much attention in various
domains, including machine learning, natural language processing, and information …

WEIRD FAccTs: How Western, Educated, Industrialized, Rich, and Democratic is FAccT?

AA Septiandri, M Constantinides, M Tahaei… - Proceedings of the …, 2023 - dl.acm.org
Studies conducted on Western, Educated, Industrialized, Rich, and Democratic (WEIRD)
samples are considered atypical of the world's population and may not accurately represent …

Algorithmic fairness datasets: the story so far

A Fabris, S Messina, G Silvello, GA Susto - Data Mining and Knowledge …, 2022 - Springer
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 …

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 …

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 …

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 …

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 …

Active sampling for min-max fairness

J Abernethy, P Awasthi, M Kleindessner… - arXiv preprint arXiv …, 2020 - arxiv.org
We propose simple active sampling and reweighting strategies for optimizing min-max
fairness that can be applied to any classification or regression model learned via loss …