LHS-based hybrid microdata vs rank swapping and microaggregation for numeric microdata protection

DOI10.1007/3-540-47804-3_12MaRDI QIDQ4738659zbMATH OpenFDO

Authors Ramesh A. Dandekar, Josep Domingo-Ferrer, Francesc Sebé

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2316/23160153.htm

zbMATH Keywords

microaggregationMicrodata maskingrank swappingsynthetic microdata generation

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• Sensitive micro data protection using Latin hypercube sampling technique
• Post-masking optimization of the tradeoff between information loss and disclosure risk in masked microdata sets
• A comparative study of microaggregation methods
• Disclosure risk assessment in perturbative microdata protection
• Improving Microaggregation for Complex Record Anonymization

Cited in

(4)

• Significance tests for multi-component estimands from multiply imputed, synthetic microdata
• A polynomial-time approximation to optimal multivariate microaggregation
• A class of heuristics for the constrained forest problem
• Another greedy heuristic for the constrained forest problem

This page was built for publication: LHS-based hybrid microdata vs rank swapping and microaggregation for numeric microdata protection

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