A polynomial-time approximation to optimal multivariate microaggregation
From MaRDI portal
Publication:2426893
DOI10.1016/j.camwa.2007.04.034zbMath1145.94012MaRDI 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
Related Items
A minimum spanning tree equipartition algorithm for microaggregation, Column generation bounds for numerical microaggregation, Probability and quantile estimation from individually micro-aggregated data, Importance partitioning in micro-aggregation, Hardness of \(k\)-anonymous microaggregation, Efficient \(k\)-anonymous microaggregation of multivariate numerical data via principal component analysis, The effect of microaggregation by individual ranking on the estimation of moments, A derivative-free algorithm for refining numerical microaggregation solutions, A Linear-Time Multivariate Micro-aggregation for Privacy Protection in Uniform Very Large Data Sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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