Algorithms 2013, 6(4), 678-701; doi:10.3390/a6040678
Article

Pattern-Guided k-Anonymity

email, * email and email
Received: 2 August 2013; in revised form: 9 October 2013 / Accepted: 9 October 2013 / Published: 17 October 2013
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing (blanking out) as few entries as possible. Building on previous work and coping with corresponding deficiencies, we describe an enhanced k-anonymization problem called PATTERN-GUIDED k-ANONYMITY, where the users specify in which combinations suppressions may occur. In this way, the user of the anonymized data can express the differing importance of various data features. We show that PATTERN-GUIDED k-ANONYMITY is NP-hard. We complement this by a fixed-parameter tractability result based on a “data-driven parameterization” and, based on this, develop an exact integer linear program (ILP)-based solution method, as well as a simple, but very effective, greedy heuristic. Experiments on several real-world datasets show that our heuristic easily matches up to the established “Mondrian” algorithm for k-ANONYMITY in terms of the quality of the anonymization and outperforms it in terms of running time.
Keywords: NP-hardness; parameterized complexity; integer linear programming; exact algorithms; heuristics; experiments
PDF Full-text Download PDF Full-Text [288 KB, Updated Version, uploaded 18 October 2013 16:55 CEST]
The original version is still available [288 KB, uploaded 17 October 2013 17:05 CEST]

Export to BibTeX |
EndNote


MDPI and ACS Style

Bredereck, R.; Nichterlein, A.; Niedermeier, R. Pattern-Guided k-Anonymity. Algorithms 2013, 6, 678-701.

AMA Style

Bredereck R, Nichterlein A, Niedermeier R. Pattern-Guided k-Anonymity. Algorithms. 2013; 6(4):678-701.

Chicago/Turabian Style

Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf. 2013. "Pattern-Guided k-Anonymity." Algorithms 6, no. 4: 678-701.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert