IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v53y2005i5p819-829.html
   My bibliography  Save this article

A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods

Author

Listed:
  • Juan-José Salazar-González

    (DEIOC, Universidad de La Laguna, 38271 La Laguna, Tenerife, Spain)

Abstract

This paper concerns statistical disclosure control methods to minimize information loss while keeping small the disclosure risk from different data snoopers. This issue is of primary importance in practice for statistical agencies when publishing data. It is assumed that the sensitive data have been identified by practitioners in the statistical offices, and the paper addresses the secondary problem of protecting these data with different methods, all defined in a unified mathematical framework. A common definition of protection is used in four different methodologies. Two integer linear programming models described in the literature for the cell suppression methodology are extended to work also for the controlled rounding methodology. In addition, two relaxed variants are presented using two associated linear programming models, called partial cell suppression and partial controlled rounding , respectively. A final discussion shows how to combine the four methods and how to implement a cutting-plane approach for the exact and heuristic resolution of the combinatorial problems in practice. This approach was implemented in ARGUS, a software package of disclosure limitation tools.

Suggested Citation

  • Juan-José Salazar-González, 2005. "A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods," Operations Research, INFORMS, vol. 53(5), pages 819-829, October.
    • Handle: RePEc:inm:oropre:v:53:y:2005:i:5:p:819-829
    DOI: 10.1287/opre.1040.0202
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1040.0202
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1040.0202?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. James Kelly & Bruce Golden & Arjang Assad, 1990. "Using Simulated Annealing to Solve Controlled Rounding Problems," INFORMS Journal on Computing, INFORMS, vol. 2(2), pages 174-185, May.
    2. James P. Kelly & Bruce L. Golden & Arjang A. Assad & Edward K. Baker, 1990. "Controlled Rounding of Tabular Data," Operations Research, INFORMS, vol. 38(5), pages 760-772, October.
    3. Matteo Fischetti & Juan José Salazar, 2001. "Solving the Cell Suppression Problem on Tabular Data with Linear Constraints," Management Science, INFORMS, vol. 47(7), pages 1008-1027, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Castro, Jordi, 2006. "Minimum-distance controlled perturbation methods for large-scale tabular data protection," European Journal of Operational Research, Elsevier, vol. 171(1), pages 39-52, May.
    2. George, John A. & Kuan, Chong Juin & Ring, Brendan J., 1995. "Confidentiality control of tabulated data: Some practical network models," European Journal of Operational Research, Elsevier, vol. 85(3), pages 454-472, September.
    3. Ring, Brendan J. & George, John A. & Kuan, Chong Juin, 1997. "A fast algorithm for large-scale controlled rounding of 3-dimensional census tables," Socio-Economic Planning Sciences, Elsevier, vol. 31(1), pages 41-55, March.
    4. Sage, Andrew J. & Wright, Stephen E., 2016. "Obtaining cell counts for contingency tables from rounded conditional frequencies," European Journal of Operational Research, Elsevier, vol. 250(1), pages 91-100.
    5. S F Roehrig & R Padman & R Krishnan & G T Duncan, 2011. "Exact and heuristic methods for cell suppression in multi-dimensional linked tables," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 291-304, February.
    6. Castro, Jordi, 2012. "Recent advances in optimization techniques for statistical tabular data protection," European Journal of Operational Research, Elsevier, vol. 216(2), pages 257-269.
    7. Sumit Dutta Chowdhury & George T. Duncan & Ramayya Krishnan & Stephen F. Roehrig & Sumitra Mukherjee, 1999. "Disclosure Detection in Multivariate Categorical Databases: Auditing Confidentiality Protection Through Two New Matrix Operators," Management Science, INFORMS, vol. 45(12), pages 1710-1723, December.
    8. Daniel Baena & Jordi Castro & Antonio Frangioni, 2020. "Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy," Management Science, INFORMS, vol. 66(7), pages 3051-3068, July.
    9. Zhang, Sumei & Guldmann, Jean-Michel, 2009. "Estimating suppressed data in regional economic databases: A goal-programming approach," European Journal of Operational Research, Elsevier, vol. 192(2), pages 521-537, January.
    10. Jordi Castro & Antonio Frangioni & Claudio Gentile, 2014. "Perspective Reformulations of the CTA Problem with L 2 Distances," Operations Research, INFORMS, vol. 62(4), pages 891-909, August.
    11. Haibing Lu & Jaideep Vaidya & Vijayalakshmi Atluri & Yingjiu Li, 2015. "Statistical Database Auditing Without Query Denial Threat," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 20-34, February.
    12. Xiao-Bai Li & Sumit Sarkar, 2013. "Class-Restricted Clustering and Microperturbation for Data Privacy," Management Science, INFORMS, vol. 59(4), pages 796-812, April.
    13. Robert Garfinkel & Ram Gopal & Steven Thompson, 2007. "Releasing Individually Identifiable Microdata with Privacy Protection Against Stochastic Threat: An Application to Health Information," Information Systems Research, INFORMS, vol. 18(1), pages 23-41, March.
    14. Ross, Anthony D., 2000. "A two-phased approach to the supply network reconfiguration problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 18-30, April.
    15. Jordi Castro, 2007. "A Shortest-Paths Heuristic for Statistical Data Protection in Positive Tables," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 520-533, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:53:y:2005:i:5:p:819-829. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.