7 citations · 11 across the 5 of their papers we have counts for
7 papers
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…
The Power of Uniform Sampling for Coresets
Vladimir Braverman, Vincent Cohen-Addad, Shaofeng H. -C. Jiang +4
Motivated by practical generalizations of the classic -median and -means objectives, such as clustering with size constraints, fair clustering, and Wasserstein barycenter, we…
New Coresets for Projective Clustering and Applications
Murad Tukan, Xuan Wu, Samson Zhou +2
-projective clustering is the natural generalization of the family of -clustering and -subspace clustering problems. Given a set of points in , the g…
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 Gaussian Mixture Models of Any Shape
Dan Feldman, Zahi Kfir, Xuan Wu
An -coreset for a given set of points, is usually a small weighted set, such that querying the coreset \emph{provably} yields a -factor approx…
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…