Efficient algorithms for fair clustering with a new notion of fairness

DOI10.1007/s10618-023-00928-6arXiv2109.00708OpenAlexW4327938278MaRDI QIDQ6052264

Shweta Jain, Narayanan C. Krishnan, Shivam Gupta, Ganesh Ghalme

Publication date: 21 September 2023

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.00708

zbMATH Keywords

fairnessclusteringunsupervised learningmachine learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for fair \(k\)-clustering with multiple protected attributes
• Fair coresets and streaming algorithms for fair \(k\)-means
• Fairness through awareness
• On the existence of resonances in the transmission probability for interactions arising from derivatives of Dirac s delta function
• A Lottery Model for Center-Type Problems With Outliers
• A Technique for Obtaining True Approximations for k-Center with Covering Constraints
• Fair Colorful k-Center Clustering
• An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
• On the cost of essentially fair clusterings
• Tight FPT approximation for socially fair clustering

This page was built for publication: Efficient algorithms for fair clustering with a new notion of fairness