Liren Shan

activity

20172026

most citedCurrent Flow Group Closeness Centrality for Complex Networks

46 citations · 114 across the 18 of their papers we have counts for

collaborators

Showing 2021Show 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 $O ~ (lo g^{2} k)$ competitive algorithm for explainable $k$ -means clustering. Explainable $k$ -means was recently introduced by Dasgupta, Frost, Mos…

cs.DS2021★ 8 cited

Near-optimal Algorithms for Explainable k-Medians and k-Means

Konstantin Makarychev, Liren Shan

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 thres…