6 citations · 10 across the 3 of their papers we have counts for
5 papers · 1 filter
Near-optimal Coresets for Robust Clustering
Lingxiao Huang, Shaofeng H. -C. Jiang, Jianing Lou +1
We consider robust clustering problems in , specifically -clustering problems (e.g., -Median and -Means with outliers, where the cost for a given center…
Coresets for Clustering in Excluded-minor Graphs and Beyond
Vladimir Braverman, Shaofeng H. -C. Jiang, Robert Krauthgamer +1
Coresets are modern data-reduction tools that are widely used in data analysis to improve efficiency in terms of running time, space and communication complexity. Our main result i…
Coresets for Clustering with Fairness Constraints
Lingxiao Huang, Shaofeng H. -C. Jiang, Nisheeth K. Vishnoi
In a recent work, [19] studied the following "fair" variants of classical clustering problems such as -means and -median: given a set of data points in and…
Coresets for Ordered Weighted Clustering
Vladimir Braverman, Shaofeng H. -C. Jiang, Robert Krauthgamer +1
We design coresets for Ordered k-Median, a generalization of classical clustering problems such as k-Median and k-Center, that offers a more flexible data analysis, like easily com…
-Coresets for Clustering (with Outliers) in Doubling Metrics
Lingxiao Huang, Shaofeng H. -C. Jiang, Jian Li +1
We study the problem of constructing -coresets for the -clustering problem in a doubling metric . An -coreset is a weighted subset $S\sub…