Fair k-Center Clustering in MapReduce and Streaming Settings-Reference-Cited by-同舟云学术

Fair k-Center Clustering in MapReduce and Streaming Settings

Published:2022-04-25 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM Web Conference 2022
language:
Short-container-title:

Author:

Bera Suman K.¹,Das Syamantak²,Galhotra Sainyam³,Kale Sagar Sudhir⁴

Affiliation:

1. Katana Graph, USA

2. IIIT Delhi, India

3. University of Chicago, USA

4. University of Vienna, Austria

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3485447.3512188

Reference29 articles.

1. [n.d.]. Google + dataset SNAP http://snap.stanford.edu/data/ego-Gplus.html. [n.d.]. Google + dataset SNAP http://snap.stanford.edu/data/ego-Gplus.html.

2. [n.d.]. Pokec dataset , SNAP , http://snap.stanford.edu/data/soc-Pokec.html. [n.d.]. Pokec dataset, SNAP, http://snap.stanford.edu/data/soc-Pokec.html.

3. Saba Ahmadi Sainyam Galhotra Barna Saha and Roy Schwartz. 2020. Fair Correlation Clustering. CoRR abs/2002.03508(2020). arXiv:2002.03508https://arxiv.org/abs/2002.03508 Saba Ahmadi Sainyam Galhotra Barna Saha and Roy Schwartz. 2020. Fair Correlation Clustering. CoRR abs/2002.03508(2020). arXiv:2002.03508https://arxiv.org/abs/2002.03508

4. Clustering without Over-Representation

5. Communication Steps for Parallel Query Processing

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast and Accurate Fair k-Center Clustering in Doubling Metrics;Proceedings of the ACM Web Conference 2024;2024-05-13

2. New algorithms for fair k-center problem with outliers and capacity constraints;Theoretical Computer Science;2024-05

3. Massively parallel and streaming algorithms for balanced clustering;Theoretical Computer Science;2024-02

4. F3KM: Federated, Fair, and Fast k-means;Proceedings of the ACM on Management of Data;2023-12-08