This paper describes computational experiments with an algorithm for control-rounding any series of linked tables such as typically occur in official statistics, for the purpose of confidentiality protection of the individual contributors to the tables. The resulting tables consist only of multiples of the specified rounding base, are additive, and have specified levels of confidentiality protection. Computational experiments are presented demonstrating the considerable power of the program for control-rounding very large tables or series of linked tables. Heuristic approaches to problematic cases are presented, as are procedures for specifying the input to the program. The statistical properties of the rounding perturbations are described, and a method of overcoming statistical bias in the rounding algorithm is demonstrated. © Springer-Verlag 2004.
Salazar-González, J. J., Lowthian, P., Young, C., Merola, G., Bond, S., & Brown, D. (2004). Getting the best results in controlled rounding with the least effort. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3050, 58–72. https://doi.org/10.1007/978-3-540-25955-8_5