Public use of microdata files requires preprocessing to protect privacy. Microaggre- gation consists in aggregating data into clusters of size at least k such that the spread between individuals' and centroid cluster values is minimized. This paper proposes an algorithm based on Column Generation to compute lower bounds on the spread.
An algorithm for computing lower bounds for the Microaggregation problem
Claudio Gentile;
2018
Abstract
Public use of microdata files requires preprocessing to protect privacy. Microaggre- gation consists in aggregating data into clusters of size at least k such that the spread between individuals' and centroid cluster values is minimized. This paper proposes an algorithm based on Column Generation to compute lower bounds on the spread.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
