activity
20122026
most citedGreedy Strategy Works for -Center Clustering with Outliers and Coreset Construction

11 citations · 35 across the 24 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2026

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions

Kangke Cheng, Shihong Song, Guanlin Mo +1

In this paper, we investigate the learning-augmented -median clustering problem, which aims to improve the performance of traditional clustering algorithms by preprocessing the…

cs.DS2023

A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem

Xiaoyang Xu, Hu Ding

Optimal transport is a fundamental topic that has attracted a great amount of attention from the optimization community in the past decades. In this paper, we consider an interesti…

cs.DS2023

Sublinear Time Algorithms for Several Geometric Optimization (With Outliers) Problems In Machine Learning

Hu Ding

In this paper, we study several important geometric optimization problems arising in machine learning. First, we revisit the Minimum Enclosing Ball (MEB) problem in Euclidean space…

cs.DS2019

The Effectiveness of Uniform Sampling for Center-Based Clustering with Outliers

Hu Ding, Jiawei Huang, Haikuo Yu

Clustering has many important applications in computer science, but real-world datasets often contain outliers. Moreover, the presence of outliers can make the clustering problems…

cs.DS2017★ 4 cited

Capacitated Center Problems with Two-Sided Bounds and Outliers

Hu Ding, Lunjia Hu, Lingxiao Huang +1

In recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices , we want to find a subset of vertices , called centers, s…