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.CGShow all

13 papers · 1 filter

cs.CG2020

A Sub-linear Time Framework for Geometric Optimization with Outliers in High Dimensions

Hu Ding

Many real-world problems can be formulated as geometric optimization problems in high dimensions, especially in the fields of machine learning and data mining. Moreover, we often n…

cs.CG2020

Layered Sampling for Robust Optimization Problems

Hu Ding, Zixiu Wang

In real world, our datasets often contain outliers. Moreover, the outliers can seriously affect the final machine learning result. Most existing algorithms for handling outliers ta…

cs.CG2020

A Data-Dependent Algorithm for Querying Earth Mover's Distance with Low Doubling Dimensions

Hu Ding, Tan Chen, Fan Yang +1

In this paper, we consider the following query problem: given two weighted point sets and in the Euclidean space , we want to quickly determine that whether t…

cs.CG2020

The Effectiveness of Johnson-Lindenstrauss Transform for High Dimensional Optimization With Adversarial Outliers, and the Recovery

Hu Ding, Ruizhe Qin, Jiawei Huang

In this paper, we consider robust optimization problems in high dimensions. Because a real-world dataset may contain significant noise or even specially crafted samples from some a…

cs.CG2019★ 3 cited

Minimum Enclosing Ball Revisited: Stability and Sub-linear Time Algorithms

Hu Ding

In this paper, we revisit the Minimum Enclosing Ball (MEB) problem and its robust version, MEB with outliers, in Euclidean space . Though the problem has been extensi…

cs.CG2019★ 11 cited

Greedy Strategy Works for -Center Clustering with Outliers and Coreset Construction

Hu Ding, Haikuo Yu, Zixiu Wang

We study the problem of -center clustering with outliers in arbitrary metrics and Euclidean space. Though a number of methods have been developed in the past decades, it is stil…

cs.CG2018

A Unified Framework for Clustering Constrained Data without Locality Property

Hu Ding, Jinhui Xu

In this paper, we consider a class of constrained clustering problems of points in , where could be rather high. A common feature of these problems is that thei…

cs.CG2018★ 2 cited

Faster Balanced Clusterings in High Dimension

Hu Ding

The problem of constrained clustering has attracted significant attention in the past decades. In this paper, we study the balanced -center, -median, and -means clustering…

cs.CG2018

On Geometric Prototype And Applications

Hu Ding, Manni Liu

In this paper, we propose to study a new geometric optimization problem called "geometric prototype" in Euclidean space. Given a set of patterns, where each pattern is represented…

cs.CG2018★ 1 cited

A Novel Geometric Approach for Outlier Recognition in High Dimension

Hu Ding, Mingquan Ye

Outlier recognition is a fundamental problem in data analysis and has attracted a great deal of attention in the past decades. However, most existing methods still suffer from seve…

cs.CG2017★ 6 cited

Balanced -Center Clustering When Is A Constant

Hu Ding

The problem of constrained -center clustering has attracted significant attention in the past decades. In this paper, we study balanced -center cluster where the size of each…

cs.CG2012

Linear Time Algorithm for Projective Clustering

Hu Ding, Jinhui Xu

Projective clustering is a problem with both theoretical and practical importance and has received a great deal of attentions in recent years. Given a set of points in $\mathbb…

cs.CG2012★ 1 cited

Chromatic Clustering in High Dimensional Space

Hu Ding, Jinhui Xu

In this paper, we study a new type of clustering problem, called {\em Chromatic Clustering}, in high dimensional space. Chromatic clustering seeks to partition a set of colored poi…