Abstract
Microaggregation is a disclosure limitation method that provides security through k-anonymity by modifying data before release but does not allow suppression of data. We define the microaggregation problem with suppression (MPS) to accommodate data suppression, and present a polynomial-time algorithm, based on dynamic programming, for optimal univariate microaggregation with suppression. Experimental results demonstrate the practical benefits of suppressing a few carefully selected data points during microaggregation using our method.
| Original language | American English |
|---|---|
| Article number | 3 |
| Pages (from-to) | 677-682 |
| Number of pages | 6 |
| Journal | Journal of Systems and Software |
| Volume | 86 |
| Issue number | 3 |
| DOIs | |
| State | Published - Mar 1 2013 |
ASJC Scopus Subject Areas
- Software
- Information Systems
- Hardware and Architecture
Keywords
- Data security
- Privacy
- Disclosure control
- Microaggregation
- Dynamic programming
Disciplines
- Computer Sciences
Fingerprint
Dive into the research topics of 'Optimal univariate microaggregation with data suppression'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS