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

基于TopDown方法的分层起点-终点数据差分隐私发布

Differentially Private Release of Hierarchical Origin/Destination Data with a TopDown Approach

Fabrizio Boninsegna, Francesco Silvestri

AI总结:

本文提出一种基于TopDown算法与切比雪夫距离约束优化的分层O/D数据差分隐私发布方法,通过整数优化减少假阳性,在保证隐私的同时提升聚合查询精度。

摘要:

本文提出了一种为分层数据生成差分隐私表格数据集的新方法,特别聚焦于起点-终点(O/D)出行数据。该方法建立在TopDown算法之上,该算法是由美国人口普查局开发的基于约束的机制,用于将不变查询纳入表格数据。O/D分层数据是指表示地理区域之间出行的数据集,这些地理区域按层级结构组织(例如,区域→省→城市)。所提出的方法旨在提高覆盖更广泛地理区域的查询的准确性,这些查询通过聚合得到。这一特性为数据集提供了“放大”效果,确保当缩放回整体视图时,总体图景得以保留。此外,该方法旨在减少假阳性检测。这些特性可以增强从业者和决策者采用差分隐私数据集的信心。本文的主要技术贡献包括一种新颖的TopDown算法,该算法采用带切比雪夫距离最小化的约束优化,并对最大绝对误差提供理论保证。此外,我们提出了一种新的整数优化算法,显著降低了假阳性的发生率。所提出方法的有效性在真实世界和合成的O/D数据集上得到验证,证明了其生成具有高实用性和较少假阳性数量的私有数据的能力。我们的实验聚焦于以单次出行为隐私单位的O/D数据集:尽管如此,所提出的方法支持其他隐私单位,并且也适用于任何具有分层结构的表格数据。

英文摘要:

This paper presents a novel method for generating differentially private tabular datasets for hierarchical data, specifically focusing on origin-destination (O/D) trips. The approach builds upon the TopDown algorithm, a constraint-based mechanism developed by the U.S. Census to incorporate invariant queries into tabular data. O/D hierarchical data refers to datasets representing trips between geographical areas organized in a hierarchical structure (e.g., region $\rightarrow$ province $\rightarrow$ city). The proposed method is designed to improve the accuracy of queries covering broader geographical areas, which are derived through aggregation. This feature provides a "zoom-in" effect on the dataset, ensuring that when zoomed back out, the overall picture is preserved. Furthermore, the approach aims to reduce false positive detection. These characteristics can strengthen practitioners' and decision-makers' confidence in adopting differential privacy datasets. The main technical contribution of this paper includes a novel TopDown algorithm that employs constrained optimization with Chebyshev distance minimization, with theoretical guarantees on the maximum absolute error. Additionally, we propose a new integer optimization algorithm that significantly reduces the incidence of false positives. The effectiveness of the proposed approach is validated using real-world and synthetic O/D datasets, demonstrating its ability to generate private data with high utility and a reduced number of false positives. Our experiments focus on O/D datasets with a single trip as a unit of privacy: nevertheless, the proposed approach supports other units of privacy and also applies to any tabular data with a hierarchical structure.

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

↑