Near-Optimal Algorithms for Explainable k-Medians and k-MeansDownload PDFOpen Website

2021 (modified: 18 Apr 2023)ICML 2021Readers: Everyone
Abstract: We consider the problem of explainable $k$-medians and $k$-means introduced by Dasgupta, Frost, Moshkovitz, and Rashtchian (ICML 2020). In this problem, our goal is to find a \emph{threshold decisi...
0 Replies

Loading