CEC Faculty Articles

Title

Optimal univariate microaggregation with data suppression

Document Type

Article

Date

3-1-2013

Publication Title

Journal of Systems and Software

ISSN or ISBN

0164-1212

Volume

86

Issue

3

First Page

677

Last Page

682

Description

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.

DOI

10.1016/j.jss.2012.10.901

Find in your library

Share

COinS