用于Jaccard相似性估计的差分私有草图
Differentially Private Sketches for Jaccard Similarity Estimation
摘要:
本文描述了两个局部差分私有算法释放用户向量,使这些向量之间的Jaccard相似性可以有效地估计。基本构建块是众所周知的MinHash方法。为了实现隐私-效用权衡,MinHash使用广义随机响应和拉普拉斯机制的变体以两种方式进行扩展。理论分析提供了绝对误差的界限,实验显示了合成数据和真实数据的实用性-隐私权衡。本文最后对相关工作进行了批判性的讨论。
英文摘要:
This paper describes two locally-differential private algorithms for releasing user vectors such that the Jaccard similarity between these vectors can be efficiently estimated. The basic building block is the well known MinHash method. To achieve a privacy-utility trade-off, MinHash is extended in two ways using variants of Generalized Randomized Response and the Laplace Mechanism. A theoretical analysis provides bounds on the absolute error and experiments show the utility-privacy trade-off on synthetic and real-world data. The paper ends with a critical discussion of related work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。