Location of Repository

Pattern-Guided k-Anonymity

By Rolf Niedermeier, André Nichterlein and Robert Bredereck

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

Topics: NP-hardness, parameterized complexity, integer linear programming, exact algorithms, heuristics, experiments, Mathematics, QA1-939, Science, Q, DOAJ:Mathematics, DOAJ:Mathematics and Statistics, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95
Publisher: MDPI AG
Year: 2013
DOI identifier: 10.3390/a6040678
OAI identifier: oai:doaj.org/article:b4274ebd305b44febea3e60515aad934
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/toc/1999-4893 (external link)
  • http://www.mdpi.com/1999-4893/... (external link)
  • https://doaj.org/article/b4274... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.