Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.05900

Help | Advanced Search

Computer Science > Cryptography and Security

arXiv:2506.05900 (cs)
[Submitted on 6 Jun 2025 ]

Title: Differentially Private Explanations for Clusters

Title: 差分隐私的聚类解释

Authors:Amir Gilad, Tova Milo, Kathy Razmadze, Ron Zadicario
Abstract: The dire need to protect sensitive data has led to various flavors of privacy definitions. Among these, Differential privacy (DP) is considered one of the most rigorous and secure notions of privacy, enabling data analysis while preserving the privacy of data contributors. One of the fundamental tasks of data analysis is clustering , which is meant to unravel hidden patterns within complex datasets. However, interpreting clustering results poses significant challenges, and often necessitates an extensive analytical process. Interpreting clustering results under DP is even more challenging, as analysts are provided with noisy responses to queries, and longer, manual exploration sessions require additional noise to meet privacy constraints. While increasing attention has been given to clustering explanation frameworks that aim at assisting analysts by automatically uncovering the characteristics of each cluster, such frameworks may also disclose sensitive information within the dataset, leading to a breach in privacy. To address these challenges, we present DPClustX, a framework that provides explanations for black-box clustering results while satisfying DP. DPClustX takes as input the sensitive dataset alongside privately computed clustering labels, and outputs a global explanation, emphasizing prominent characteristics of each cluster while guaranteeing DP. We perform an extensive experimental analysis of DPClustX on real data, showing that it provides insightful and accurate explanations even under tight privacy constraints.
Abstract: 保护敏感数据的迫切需求催生了各种隐私定义的版本。在这其中,差分隐私(DP)被认为是隐私概念中最严格和最安全的一种,它能够在保护数据贡献者隐私的同时进行数据分析。数据分析的一项基本任务就是聚类,旨在揭示复杂数据集中隐藏的模式。然而,解释聚类结果带来了显著的挑战,并且通常需要一个详尽的分析过程。在差分隐私下解释聚类结果更具挑战性,因为分析师得到的是查询的噪声响应,并且更长的手动探索会话需要额外的噪声以满足隐私约束。尽管越来越多的关注被放在旨在通过自动揭示每个聚类特征来帮助分析师的聚类解释框架上,但这些框架也可能泄露数据集中的敏感信息,从而导致隐私泄露。为了解决这些挑战,我们提出了DPClustX,这是一个在满足差分隐私的同时提供黑盒聚类结果解释的框架。DPClustX以敏感数据集及其私有计算的聚类标签作为输入,并输出全局解释,强调每个聚类的突出特征,同时确保满足差分隐私。我们在真实数据上对DPClustX进行了广泛的实验分析,结果显示即使在严格的隐私约束下,它也能提供具有洞察力且准确的解释。
Subjects: Cryptography and Security (cs.CR) ; Databases (cs.DB)
Cite as: arXiv:2506.05900 [cs.CR]
  (or arXiv:2506.05900v1 [cs.CR] for this version)
  https://doi.org/10.48550/arXiv.2506.05900
arXiv-issued DOI via DataCite

Submission history

From: Ron Zadicario [view email]
[v1] Fri, 6 Jun 2025 09:14:45 UTC (755 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.CR
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs
cs.DB

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号