A Tutorial on Computing $t$-Closeness

November 25, 2019 ยท The Cartographer ยท ๐Ÿ› arXiv.org

๐Ÿ“š THE CARTOGRAPHER: The Cartographer
Survey/review paper โ€” maps the landscape rather than implementing a method.

"No code URL or promise found in abstract"
"Title-pattern auto-detect: A Tutorial on Computing $t$-Closeness"

Evidence collected by the PWNC Scanner

Authors Richard Dosselmann, Mehdi Sadeqi, Howard J. Hamilton arXiv ID 1911.11212 Category cs.CR: Cryptography & Security Cross-listed cs.DB Citations 1 Venue arXiv.org Last Checked 4 days ago
Abstract
This paper presents a tutorial of the computation of $t$-closeness. An established model in the domain of privacy preserving data publishing, $t$-closeness is a measure of the earth mover's distance between two distributions of an anonymized database table. This tutorial includes three examples that showcase the full computation of $t$-closeness in terms of both numerical and categorical attributes. Calculations are carried out using the definition of the earth mover's distance and weighted order distance. This paper includes detailed explanations and calculations not found elsewhere in the literature. An efficient algorithm to calculate the $t$-closeness of a table is also presented.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Cryptography & Security