Fair algorithms for clustering

S Bera, D Chakrabarty, N Flores… - Advances in Neural …, 2019 - proceedings.neurips.cc
We study the problem of finding low-cost {\em fair clusterings} in data where each data point
may belong to many protected groups. Our work significantly generalizes the seminal work …
被引用次数：277 相关文章

Fair Algorithms for Clustering

SK Bera, D Chakrabarty, NJ Flores… - arXiv preprint arXiv …, 2019 - arxiv.org
We study the problem of finding low-cost Fair Clusterings in data where each data point may
belong to many protected groups. Our work significantly generalizes the seminal work of …

Fair algorithms for clustering

SK Bera, D Chakrabarty, NJ Flores… - Proceedings of the 33rd …, 2019 - dl.acm.org
We study the problem of finding low-cost fair clusterings in data where each data point may
belong to many protected groups. Our work significantly generalizes the seminal work of …
[PDF] neurips.cc

[PDF][PDF] Fair Algorithms for Clustering

SK Bera, D Chakrabarty, NJ Flores, M Negahbani - papers.neurips.cc
We study the problem of finding low-cost fair clusterings in data where each data point may
belong to many protected groups. Our work significantly generalizes the seminal work of …

Fair Algorithms for Clustering

SK Bera, D Chakrabarty, NJ Flores… - arXiv e …, 2019 - ui.adsabs.harvard.edu
We study the problem of finding low-cost Fair Clusterings in data where each data point may
belong to many protected groups. Our work significantly generalizes the seminal work of …

Fair Algorithms for Clustering

S Bera, D Chakrabarty, N Flores… - Advances in Neural …, 2019 - proceedings.neurips.cc
We study the problem of finding low-cost {\em fair clusterings} in data where each data point
may belong to many protected groups. Our work significantly generalizes the seminal work …