Pattern-Guided Data Anonymization and Clustering

DOI10.1007/978-3-642-22993-0_19MaRDI QIDQ3088038zbMATH OpenOpenAlexFDO

Authors Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip

Publication date 17 August 2011

Published in Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22993-0_19

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Pattern-guided k-anonymity
• Pattern-guided \(k\)-anonymity
• Achieving anonymity via clustering

Cited in

(5)

• Pattern-guided k-anonymity
• The effect of homogeneity on the computational complexity of combinatorial data anonymization
• The effect of homogeneity on the complexity of \(k\)-anonymity
• The l-diversity problem: tractability and approximability
• Pattern-guided \(k\)-anonymity

This page was built for publication: Pattern-Guided Data Anonymization and Clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088038)