Nissim, KobbiStemmer, UriVadhan, Salil2016-11-042016Nissim, 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.978-1-4503-4191-2/16/06http://nrs.harvard.edu/urn-3:HUL.InstRepos:29324500We 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.en-USDifferential privacyclusteringsample and aggregateConference Paper2016-04-1320162016-11-0410.1145/2902251.2902296