Differentially Private Release of Hierarchical Origin/Destination Data with a TopDown Approach
Fabrizio Boninsegna, Francesco Silvestri

TL;DR
This paper introduces a novel differentially private method for hierarchical origin-destination data that enhances query accuracy and reduces false positives using a TopDown approach with constrained optimization.
Contribution
It develops a new TopDown algorithm employing constrained optimization and Chebyshev distance minimization, with theoretical error guarantees and an integer optimization method to lower false positives.
Findings
High utility in real-world and synthetic datasets
Reduced false positive detection compared to existing methods
Effective for hierarchical O/D data with privacy guarantees
Abstract
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 province 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'…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data
