Scalable fair clustering
We study the fair variant of the classic k-median problem introduced by Chierichetti et al. (Chierichetti et al., 2017) in which the points are colored, and the goal is to minimize the same average distance objective as in the standard k-median problem while ensuring that all clusters have an "...
| Main Authors: | , , , |
|---|---|
| 其他作者: | |
| 格式: | 文件 |
| 语言: | English |
| 出版: |
International Machine Learning Society
2021
|
| 在线阅读: | https://hdl.handle.net/1721.1/129421 |