@conference {633850,
	title = {Locating a small cluster privately},
	booktitle = {Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS {\textquoteleft}16)},
	year = {2016},
	pages = {413-427},
	publisher = {ACM},
	organization = {ACM},
	abstract = {
	Version History:\&nbsp;Full version posted as arXiv:1604.05590 [cs.DS].



	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 {\textquotedblleft}off the shelf{\textquotedblright} (non-private) analyses into analyses that preserve differential privacy.\&nbsp;

},
	url = {https://dl.acm.org/citation.cfm?id=2902296},
	author = {Kobbi Nissim and Uri Stemmer and Salil Vadhan}
}
