CCE Faculty Articles

A Polynomial Algorithm for Optimal Univariate Microaggregation

Document Type

Article

Publication Title

IEEE Transactions on Knowledge and Data Engineering

ISSN

1041-4347

Publication Date

7-1-2003

Abstract

Microaggregation is a technique used by statistical agencies to limit disclosure of sensitive microdata. Noting that no polynomial algorithms are known to microaggregate optimally, Domingo-Ferrer and Mateo-Sanz have presented heuristic microaggregation methods. This paper is the first to present an efficient polynomial algorithm for optimal univariate microaggregation. Optimal partitions are shown to correspond to shortest paths in a network.

DOI

10.1109/TKDE.2003.1209020

Volume

15

Issue

4

First Page

1043

Last Page

1044

Link to Full Text

Find in your library

Share

COinS