Efficient k-anonymous microaggregation of multivariate numerical data via principal component analysis
From MaRDI portal
Publication:2224935
Recommendations
- A polynomial-time approximation to optimal multivariate microaggregation
- Improving Microaggregation for Complex Record Anonymization
- A Linear-Time Multivariate Micro-aggregation for Privacy Protection in Uniform Very Large Data Sets
- scientific article; zbMATH DE number 2080028
- Efficient systematic clustering method for \(k\)-anonymization
Cites work
- scientific article; zbMATH DE number 3579922 (Why is no real title available?)
- scientific article; zbMATH DE number 1984190 (Why is no real title available?)
- A comparative study of microaggregation methods
- A modification of the Lloyd algorithm for \(k\)-anonymous quantization
- A polynomial-time approximation to optimal multivariate microaggregation
- Differential Privacy
- Introduction to algorithms.
- Least squares quantization in PCM
- On the solution of linear recurrence equations
- Principal component analysis.
Cited in
(6)- Differential privacy data publishing method based on the probabilistic principal component analysis
- A Linear-Time Multivariate Micro-aggregation for Privacy Protection in Uniform Very Large Data Sets
- Mitigating the curse of dimensionality in data anonymization
- \(a\)-diversity \(k\)-anonymity large data adaptive delay scheduling algorithm based on wavelet analysis
- Covariance's loss is privacy's gain: computationally efficient, private and accurate synthetic data
- Low-rank local tangent space embedding for subspace clustering
This page was built for publication: Efficient \(k\)-anonymous microaggregation of multivariate numerical data via principal component analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224935)