Computational experiments with minimum-distance controlled perturbation methods

Citations of this article
Mendeley users who have this article in their library.
Get full text


Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can deal with large tables of any structure and dimension, and in practice only need the solution of a linear or quadratic optimization problem. The purpose of this paper is to give insight into the behaviour of such methods through some computational experiments. In particular, the paper (1) illustrates the theoretical results about the low disclosure risk of the method; (2) analyzes the solutions provided by the method on a standard set of seven difficult and complex instances; and (3) shows the behaviour of a new approach obtained by the combination of two existing ones. © Springer-Verlag 2004.




Castro, J. (2004). Computational experiments with minimum-distance controlled perturbation methods. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3050, 73–86.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free