Publication: Locating a Small Cluster, Privately
Loading...
Open/View Files
Date
2016
Authors
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
ACM
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Nissim, Kobbi, Uri Stemmer, and Salil Vadhan. 2016. Locating a Small Cluster, Privately. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems Proceedings (PODS16), San Francisco, CA, June 26-July 1, 2016.
Abstract
We present a new algorithm for locating a small cluster of points with differential privacy [Dwork, McSherry, Nissim, and Smith, 2006]. Our algorithm has implications to private data exploration, clustering, and removal of outliers. Furthermore, we use it to significantly relax the requirements of the sample and aggregate technique [Nissim, Raskhodnikova, and Smith, 2007], which allows compiling of “off the shelf” (non-private) analyses into analyses that preserve differential privacy.
Description
Other Available Sources
Research Data
Keywords
Differential privacy, clustering, sample and aggregate
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service