A practical approximation algorithm for optimal \(k\)-anonymity

DOI10.1007/s10618-011-0235-9zbMath1260.68466OpenAlexW2168730434WikidataQ63090233 ScholiaQ63090233MaRDI QIDQ1944983

Batya Kenig, Tamir Tassa

Publication date: 28 March 2013

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-011-0235-9

zbMATH Keywords

\(k\)-anonymity\(l\)-diversityprivacy-preserving data miningapproximation algorithms for NP-hard problemsfrequent generalized itemsets

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Approximation algorithms (68W25)

Related Items (2)

The effect of homogeneity on the computational complexity of combinatorial data anonymization ⋮ Constrained obfuscation of relational databases

Uses Software

• CLOSET

Cites Work

• k-Anonymization with Minimal Loss of Information
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Database Theory - ICDT 2005

This page was built for publication: A practical approximation algorithm for optimal \(k\)-anonymity