Private coresets

DOI10.1145/1536414.1536465MaRDI QIDQ5172730zbMATH OpenOpenAlexFDO

Authors Dan Feldman, Haim Kaplan, Kobbi Nissim, Amos Fiat

Publication date 4 February 2015

Published in Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1536414.1536465

zbMATH Keywords

coresetsdifferential privacyprivacy

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Cryptography (94A60)

Recommendations

• Coresets for Discrete Integration and Clustering
• Probabilistic k-median clustering in data streams
• scientific article; zbMATH DE number 7164768
• Differentially private combinatorial optimization
• Core-sets: updated survey

Cited in

(10)

• The automorphism group of a minimal shift of stretched exponential growth
• Streaming submodular maximization under differential privacy noise
• Learning big (image) data via coresets for dictionaries
• Submodular maximization over data streams with differential privacy noise
• Core-sets: updated survey
• Simultaneous private learning of multiple concepts
• Differentially-private learning of low dimensional manifolds
• How to Find a Point in the Convex Hull Privately
• Emerging directions in Bayesian computation
• Differentially private k-center problems

This page was built for publication: Private coresets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5172730)