IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v18y2009i4d10.1007_s10878-009-9253-6.html
   My bibliography  Save this article

Fixed-parameter tractability of anonymizing data by suppressing entries

Author

Listed:
  • Patricia A. Evans

    (University of New Brunswick)

  • H. Todd Wareham

    (Memorial University)

  • Rhonda Chaytor

    (Simon Fraser University)

Abstract

A popular model for protecting privacy when person-specific data is released is k -anonymity. A dataset is k-anonymous if each record is identical to at least (k−1) other records in the dataset. The basic k-anonymization problem, which minimizes the number of dataset entries that must be suppressed to achieve k-anonymity, is NP-hard and hence not solvable both quickly and optimally in general. We apply parameterized complexity analysis to explore algorithmic options for restricted versions of this problem that occur in practice. We present the first fixed-parameter algorithms for this problem and identify key techniques that can be applied to this and other k-anonymization problems.

Suggested Citation

  • Patricia A. Evans & H. Todd Wareham & Rhonda Chaytor, 2009. "Fixed-parameter tractability of anonymizing data by suppressing entries," Journal of Combinatorial Optimization, Springer, vol. 18(4), pages 362-375, November.
    • Handle: RePEc:spr:jcomop:v:18:y:2009:i:4:d:10.1007_s10878-009-9253-6
    DOI: 10.1007/s10878-009-9253-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9253-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-009-9253-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Paola Bonizzoni & Gianluca Della Vedova & Riccardo Dondi & Yuri Pirola, 2013. "Parameterized complexity of k-anonymity: hardness and tractability," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 19-43, July.

    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:spr:jcomop:v:18:y:2009:i:4:d:10.1007_s10878-009-9253-6. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.