DBScholar

Back to papers

Locating a Small Cluster Privately

Summary: New differentially private algorithm to locate small point clusters, enabling private identification of dense subsets and outlier removal. Relaxes sample-and-aggregate requirements to enable broader conversion of off-the-shelf analyses into differentially private versions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1690
Venue
PODS
Year
2016
Pagerank
7.1990589e-05
Overall Rank
3,693 | 74.67%
DOI
10.1145/2902251.2902296

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{nissim_pods16,
        address = {New York, NY, USA},
        series = {{PODS} '16},
        title = {{Locating a Small Cluster Privately}},
        url = {https://dl.acm.org/doi/10.1145/2902251.2902296},
        doi = {10.1145/2902251.2902296},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Nissim, Kobbi and Stemmer, Uri and Vadhan, Salil},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,906 GUPT: Privacy Preserving Data Analysis Made Easy 2012 SIGMOD 9.5020196e-05
Previous Page 1 / 1 Next

Semantically Similar Papers