论文信息 - Algorithms for fair k-clustering with multiple protected attributes

Algorithms for fair k-clustering with multiple protected attributes

Abstract We study fair center based clustering problems. In an influential paper, Chierichetti, Kumar, Lattanzi and Vassilvitskii (NIPS 2017) consider the problem of finding a good clustering, say of women and men, such that every cluster contains an equal number of women and men. They were able to obtain a constant factor approximation for this problem for most center based k-clustering objectives such as k-median, k-means, and k-center. Despite considerable interest in extending this problem for multiple protected attributes (e.g. women and men, with or without citizenship), so far constant factor approximations for these problems have remained elusive except in special cases. We settle this question in the affirmative by giving the first constant factor approximation for a wide range of center based k-clustering objectives.

[1] Samir Khuller,et al. On the cost of essentially fair clusterings , 2018, APPROX-RANDOM.

[2] David Saulpic,et al. A new coreset framework for clustering , 2021, STOC.

[3] Deeparnab Chakrabarty,et al. Fair Algorithms for Clustering , 2019, NeurIPS.

[4] Roy Schwartz,et al. Fair Correlation Clustering , 2020, ArXiv.

[5] Silvio Lattanzi,et al. Fair Clustering Through Fairlets , 2018, NIPS.

[6] Krzysztof Onak,et al. Scalable Fair Clustering , 2019, ICML.

[7] Pranjal Awasthi,et al. Guarantees for Spectral Clustering with Fairness Constraints , 2019, ICML.

[8] H. Kuhn. The Hungarian method for the assignment problem , 1955 .

[9] Fedor V. Fomin,et al. On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications , 2020, ICALP.

[10] Melanie Schmidt,et al. Privacy preserving clustering with constraints , 2018, ICALP.

[11] Benjamin Moseley,et al. Fair Hierarchical Clustering , 2020, NeurIPS.

[12] Christian Sohler,et al. Fair Coresets and Streaming Algorithms for Fair k-Means Clustering , 2018, ArXiv.