arrow
Return

Differentially Private k-Nearest Neighbor Missing Data Imputation

delete2022-04-09
delete4
PRE
AI
C
Chris Clifton *
E
Eric J. Hanson
K
Keith Merrill
S
Shawn Merrill
DOI:10.1145/3507952delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Using techniques employing smooth sensitivity, we develop a method for k-nearest neighbor missing data imputation with differential privacy. This requires bounding the number of data incomplete tuples that can have their data complete donor changed by making a single addition or deletion to the dataset. The multiplicity of a single individual's impact on an imputed dataset necessarily means our mechanisms require the addition of more noise than mechanisms that ignore missing data, but we show empirically that this is significantly outweighed by the bias reduction from imputing missing data.
Keywords:
Differential privacy
statistical disclosure limitation
private data cleaning
smooth sensitivity

Journal

A
ACM Transactions on Privacy and Security
IF:
2.8
Papers:
291
Citations:
770

Organization

Purdue University System cover
Purdue University System
Scholars:
3.9W
Papers: 3.6W
Citations: 66
U
university of quebec
Scholars:
2.0W
Papers: 1.9W
Citations: 19
P
Purdue University
Scholars:
2.7W
Papers: 2.1W
Citations: 147
researcher View more organizations