Efficient k-anonymous microaggregation of multivariate numerical data via principal component analysis
DOI10.1016/J.INS.2019.07.042zbMATH Open1459.62099OpenAlexW2959990386WikidataQ127590597 ScholiaQ127590597MaRDI QIDQ2224935FDOQ2224935
Authors: Ahmad Mohamad Mezher, Xavier Casanova Colomé, Jordi Forné, Miguel Soriano, David Rebollo-Monedero 
Publication date: 4 February 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2019.07.042
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
microaggregationprincipal component analysisdata privacy\(k\)-anonymitystatistical disclosure controllarge-scale datasets
Computational methods for problems pertaining to statistics (62-08) Factor analysis and principal components; correspondence analysis (62H25) Statistical aspects of big data and data science (62R07)
Cites Work
- Differential Privacy
- Principal component analysis.
- Least squares quantization in PCM
- Introduction to algorithms.
- Title not available (Why is that?)
- On the solution of linear recurrence equations
- A polynomial-time approximation to optimal multivariate microaggregation
- A modification of the Lloyd algorithm for \(k\)-anonymous quantization
- A comparative study of microaggregation methods
- Title not available (Why is that?)
Cited In (3)
Uses Software
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)
