Differentially Private Clustering via Maximum Coverage

08/27/2020
by   Matthew Jones, et al.
0

This paper studies the problem of clustering in metric spaces while preserving the privacy of individual data. Specifically, we examine differentially private variants of the k-medians and Euclidean k-means problems. We present polynomial algorithms with constant multiplicative error and lower additive error than the previous state-of-the-art for each problem. Additionally, our algorithms use a clustering algorithm without differential privacy as a black-box. This allows practitioners to control the trade-off between runtime and approximation factor by choosing a suitable clustering algorithm to use.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/21/2018

Differentially Private k-Means with Constant Multiplicative Error

We design new differentially private algorithms for the Euclidean k-mean...
research
09/28/2020

A note on differentially private clustering with large additive error

In this note, we describe a simple approach to obtain a differentially p...
research
07/04/2019

Locally Private k-Means Clustering

We design a new algorithm for the Euclidean k-means problem that operate...
research
07/07/2023

Differential Privacy for Clustering Under Continual Observation

We consider the problem of clustering privately a dataset in ℝ^d that un...
research
07/06/2023

DPM: Clustering Sensitive Data through Separation

Privacy-preserving clustering groups data points in an unsupervised mann...
research
02/20/2023

Replicable Clustering

In this paper, we design replicable algorithms in the context of statist...
research
02/08/2019

Achieving Data Utility-Privacy Tradeoff in Internet of Medical Things: A Machine Learning Approach

The emergence and rapid development of the Internet of Medical Things (I...

Please sign up or login with your details

Forgot password? Click here to reset