Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/TKDE.2003.1209020 | IEEE Trans. Knowl. Data Eng. |
Keywords | DocType | Volume |
optimal partition,efficient polynomial algorithm,sensitive microdata,optimal univariate microaggregation,polynomial algorithm,heuristic microaggregation method,statistical agency,computational complexity,shortest path,indexing terms,clustering | Journal | 15 |
Issue | ISSN | Citations |
4 | 1041-4347 | 72 |
PageRank | References | Authors |
3.26 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephen Lee Hansen | 1 | 72 | 3.26 |
| Sumitra Mukherjee | 2 | 311 | 31.75 |