Locally private k-means clustering

MaRDI QIDQ5159461FDOQ5159461

Authors: Uri Stemmer 

Publication date: 27 October 2021

Full work available at URL: https://arxiv.org/abs/1907.02513

Recommendations

• scientific article; zbMATH DE number 7014213
• Differentially private combinatorial optimization
• Oblivious sampling with applications to two-party \(k\)-means clustering
• Heavy Hitters and the Structure of Local Privacy
• What can we learn privately?

zbMATH Keywords

clustering\(k\)-meansdifferential privacy\(k\)-medianlocal model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of Cryptography
• What can we learn privately?
• Distributed private heavy hitters
• Local, private, efficient protocols for succinct histograms
• Title not available (Why is that?)

Cited In (4)

• Density-based clustering with differential privacy
• Improved lower bound for differentially private facility location
• Private approximation of clustering and vertex cover
• Also for \(k\)-means: more data does not imply better performance

Uses Software

• SuLQ

This page was built for publication: Locally private \(k\)-means clustering

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