Colored Noise Mechanism for Differentially Private Clustering

11/15/2021
by   Nikhil Ravi, et al.
0

The goal of this paper is to propose and analyze a differentially private randomized mechanism for the K-means query. The goal is to ensure that the information received about the cluster-centroids is differentially private. The method consists in adding Gaussian noise with an optimum covariance. The main result of the paper is the analytical solution for the optimum covariance as a function of the database. Comparisons with the state of the art prove the efficacy of our approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/28/2016

Two Differentially Private Rating Collection Mechanisms for Recommender Systems

We design two mechanisms for the recommender system to collect user rati...
research
05/10/2021

Differentially Private Transfer Learning with Conditionally Deep Autoencoders

This paper considers the problem of differentially private semi-supervis...
research
01/06/2023

Covariance loss, Szemeredi regularity, and differential privacy

We show how randomized rounding based on Grothendieck's identity can be ...
research
11/23/2021

Optimum Noise Mechanism for Differentially Private Queries in Discrete Finite Sets

In this paper, we provide an optimal additive noise mechanism for databa...
research
06/05/2020

Differentially private partition selection

Many data analysis operations can be expressed as a GROUP BY query on an...
research
05/25/2018

An end-to-end Differentially Private Latent Dirichlet Allocation Using a Spectral Algorithm

Latent Dirichlet Allocation (LDA) is a powerful probabilistic model used...
research
11/02/2022

An Easy-to-use and Robust Approach for the Differentially Private De-Identification of Clinical Textual Documents

Unstructured textual data is at the heart of healthcare systems. For obv...

Please sign up or login with your details

Forgot password? Click here to reset