A Polynomial Algorithm for Optimal Univariate Microaggregation

Stephen Lee Hansen; Sumitra Mukherjee

doi:10.1109/tkde.2003.1209020

A Polynomial Algorithm for Optimal Univariate Microaggregation

Stephen Lee Hansen
, Sumitra Mukherjee

Research output: Contribution to journal › Article › peer-review

114 Scopus citations

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.

Original language	American English
Pages (from-to)	1043-1044
Number of pages	2
Journal	IEEE Transactions on Knowledge and Data Engineering
Volume	15
Issue number	4
DOIs	https://doi.org/10.1109/tkde.2003.1209020
State	Published - Jul 1 2003

ASJC Scopus Subject Areas

Information Systems
Computer Science Applications
Computational Theory and Mathematics

Keywords

Statistical databases
clustering
information loss
microaggregation
microdata protection
shortest path
Microaggregation
Shortest path
Clustering
Information loss
Microdata protection

Disciplines

Computer Sciences

Access to Document

10.1109/tkde.2003.1209020

http://dx.doi.org/10.1109/TKDE.2003.1209020

Cite this

@article{2cb6b3aeff57495bba271c1a16294070,

title = "A Polynomial Algorithm for Optimal Univariate Microaggregation",

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.",

keywords = "Statistical databases, clustering, information loss, microaggregation, microdata protection, shortest path, Microaggregation, Shortest path, Clustering, Information loss, Microdata protection",

author = "Hansen, \{Stephen Lee\} and Sumitra Mukherjee",

year = "2003",

month = jul,

day = "1",

doi = "10.1109/tkde.2003.1209020",

language = "American English",

volume = "15",

pages = "1043--1044",

journal = "IEEE Transactions on Knowledge and Data Engineering",

issn = "1041-4347",

publisher = "IEEE Computer Society",

number = "4",

}

TY - JOUR

T1 - A Polynomial Algorithm for Optimal Univariate Microaggregation

AU - Hansen, Stephen Lee

AU - Mukherjee, Sumitra

PY - 2003/7/1

Y1 - 2003/7/1

N2 - 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.

AB - 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.

KW - Statistical databases

KW - clustering

KW - information loss

KW - microaggregation

KW - microdata protection

KW - shortest path

KW - Microaggregation

KW - Shortest path

KW - Clustering

KW - Information loss

KW - Microdata protection

UR - https://nsuworks.nova.edu/gscis_facarticles/10

UR - http://dx.doi.org/10.1109/TKDE.2003.1209020

U2 - 10.1109/tkde.2003.1209020

DO - 10.1109/tkde.2003.1209020

M3 - Article

SN - 1041-4347

VL - 15

SP - 1043

EP - 1044

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

IS - 4

ER -

A Polynomial Algorithm for Optimal Univariate Microaggregation

Abstract

ASJC Scopus Subject Areas

Keywords

Disciplines

Access to Document

Other files and links

Fingerprint

Cite this