research
∙
09/02/2023
Approximating Fair k-Min-Sum-Radii in ℝ^d
The k-center problem is a classical clustering problem in which one is a...
share
research
∙
11/03/2022
Connected k-Center and k-Diameter Clustering
Motivated by an application from geodesy, we introduce a novel clusterin...
research
∙
06/14/2021
Coresets for constrained k-median and k-means clustering in low dimensional Euclidean space
We study (Euclidean) k-median and k-means with constraints in the stream...
research
∙
09/07/2020
Achieving anonymity via weak lower bound constraints for k-median and k-means
We study k-clustering problems with lower bounds, including k-median and...
research
∙
12/02/2019
Noisy, Greedy and Not So Greedy k-means++
The k-means++ algorithm due to Arthur and Vassilvitskii has become the m...
research
∙
08/07/2019
Fully dynamic hierarchical diameter k-clustering and k-center
We develop dynamic data structures for maintaining a hierarchical k-cent...
research
∙
07/11/2019
Analysis of Ward's Method
We study Ward's method for the hierarchical k-means problem. This popula...
research
∙
07/09/2019
Sublinear data structures for short Fréchet queries
We study metric data structures for curves in doubling spaces, such as t...
research
∙
12/28/2018
Fair Coresets and Streaming Algorithms for Fair k-Means Clustering
We study fair clustering problems as proposed by Chierichetti et al. Her...
research
∙
11/26/2018
On the cost of essentially fair clusterings
Clustering is a fundamental tool in data mining. It partitions points in...
research
∙
07/12/2018
Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
We develop and analyze a method to reduce the size of a very large set o...
research
∙
02/07/2018