arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.05545cs.LGcs.CR

面向协同聚类的隐私保护最优参数选择

Privacy-Preserving Optimal Parameter Selection for Collaborative Clustering

Case Western Reserve University(凯斯西储大学)

Maryam Ghasemian, Erman Ayday

AI总结:

本文研究协同聚类中隐私保护下的最优参数选择,利用差分隐私随机响应机制在保证聚类质量的同时降低成员推断攻击风险。

摘要:

本研究探讨在确保数据隐私的前提下,协同聚类中参数的最优选择问题。我们聚焦于协同框架内的关键聚类算法,在该框架中多个数据所有者合并其数据,并由一个半可信服务器协助推荐最合适的聚类算法及其参数。研究结果表明,隐私参数($ε$)对服务器的推荐结果影响极小,但$ε$的增大提高了成员推断攻击的风险,可能导致敏感信息被推断出来。为降低这些风险,我们采用差分隐私技术,特别是随机响应机制,通过添加噪声来保护数据隐私。我们的方法表明,在保持数据机密性的同时,可以实现高质量的聚类,调整兰德指数和轮廓系数等指标证实了这一点。本研究对隐私感知的数据共享、最优算法与参数选择以及数据所有者与服务器之间的有效通信做出了贡献。

英文摘要:

This study investigates the optimal selection of parameters for collaborative clustering while ensuring data privacy. We focus on key clustering algorithms within a collaborative framework, where multiple data owners combine their data. A semi-trusted server assists in recommending the most suitable clustering algorithm and its parameters. Our findings indicate that the privacy parameter ($ε$) minimally impacts the server's recommendations, but an increase in $ε$ raises the risk of membership inference attacks, where sensitive information might be inferred. To mitigate these risks, we implement differential privacy techniques, particularly the Randomized Response mechanism, to add noise and protect data privacy. Our approach demonstrates that high-quality clustering can be achieved while maintaining data confidentiality, as evidenced by metrics such as the Adjusted Rand Index and Silhouette Score. This study contributes to privacy-aware data sharing, optimal algorithm and parameter selection, and effective communication between data owners and the server.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑