Optimal univariate microaggregation with data suppression

  • Authors:
  • Michael Laszlo;Sumitra Mukherjee

  • Affiliations:
  • Graduate School of Computer and Information Sciences, Nova Southeastern University, Fort Lauderdale, FL, United States;Graduate School of Computer and Information Sciences, Nova Southeastern University, Fort Lauderdale, FL, United States

  • Venue:
  • Journal of Systems and Software
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.