23 citations · 146 across the 41 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2021★ 2 cited
Explainable k-means. Don't be greedy, plant bigger trees!
Konstantin Makarychev, Liren Shan
We provide a new bi-criteria competitive algorithm for explainable -means clustering. Explainable -means was recently introduced by Dasgupta, Frost, Mos…
cs.LG2020★ 8 cited
Improved Guarantees for k-means++ and k-means++ Parallel
Konstantin Makarychev, Aravind Reddy, Liren Shan
In this paper, we study k-means++ and k-means++ parallel, the two most popular algorithms for the classic k-means clustering problem. We provide novel analyses and show improved ap…