论文标题
关于差异私有聚类的注释，并具有较大的加性错误
A note on differentially private clustering with large additive error
论文作者
论文摘要
在本说明中，我们描述了一种简单的方法，以获得一种差异私有算法，用于k群集，其乘法因子与任何非私有关系的乘法因子几乎相同，而这些因素是以大多项式添加剂误差为代价的。该方法是独立于隐私考虑和任何具有持续近似的现有私人算法的简单几何观察的组合。
In this note, we describe a simple approach to obtain a differentially private algorithm for k-clustering with nearly the same multiplicative factor as any non-private counterpart at the cost of a large polynomial additive error. The approach is the combination of a simple geometric observation independent of privacy consideration and any existing private algorithm with a constant approximation.
