32 citations · 50 across the 21 of their papers we have counts for
4 papers · 2 filters
Faster and Simpler Greedy Algorithm for -Median and -Means
Max Dupré la Tour, David Saulpic
Clustering problems such as -means and -median are staples of unsupervised learning, and many algorithmic techniques have been developed to tackle their numerous aspects. In…
Fully Dynamic k-Means Coreset in Near-Optimal Update Time
Max Dupré la Tour, Monika Henzinger, David Saulpic
We study in this paper the problem of maintaining a solution to -median and -means clustering in a fully dynamic setting. To do so, we present an algorithm to efficiently mai…
Making Old Things New: A Unified Algorithm for Differentially Private Clustering
Max Dupré la Tour, Monika Henzinger, David Saulpic
As a staple of data analysis and unsupervised learning, the problem of private clustering has been widely studied under various privacy models. Centralized differential privacy is…
Sensitivity Sampling for -Means: Worst Case and Stability Optimal Coreset Bounds
Nikhil Bansal, Vincent Cohen-Addad, Milind Prabhu +2
Coresets are arguably the most popular compression paradigm for center-based clustering objectives such as -means. Given a point set , a coreset is a small, weighted summ…