A polynomial-time approximation to optimal multivariate microaggregation

DOI10.1016/j.camwa.2007.04.034zbMath1145.94012OpenAlexW2155857880MaRDI QIDQ2426893

Francesc Sebé, Agusti Solanas, Josep Domingo-Ferrer

Publication date: 14 May 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.04.034

zbMATH Keywords

optimal controlapproximate algorithmstatistical disclosure control

Mathematics Subject Classification ID

Database theory (68P15) Authentication, digital signatures and secret sharing (94A62)

Related Items (9)

The effect of microaggregation by individual ranking on the estimation of moments ⋮ A minimum spanning tree equipartition algorithm for microaggregation ⋮ A Linear-Time Multivariate Micro-aggregation for Privacy Protection in Uniform Very Large Data Sets ⋮ Efficient \(k\)-anonymous microaggregation of multivariate numerical data via principal component analysis ⋮ Column generation bounds for numerical microaggregation ⋮ Hardness of \(k\)-anonymous microaggregation ⋮ Importance partitioning in micro-aggregation ⋮ Probability and quantile estimation from individually micro-aggregated data ⋮ A derivative-free algorithm for refining numerical microaggregation solutions

Uses Software

• ARGUS

Cites Work

• Minimum sum of squares clustering in a low dimensional space
• Elements of statistical disclosure control
• Auditing and Inference Control in Statistical Databases
• An Algorithm for Euclidean Sum of Squares Classification
• EXACT AND APPROXIMATE METHODS FOR DATA DIRECTED MICROAGGREGATION IN ONE OR MORE DIMENSIONS
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• Security of statistical databases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial-time approximation to optimal multivariate microaggregation