Next Article in Journal
New Parallel Sparse Direct Solvers for Multicore Architectures
Previous Article in Journal
Sublinear Time Motif Discovery from Multiple Sequences
Open AccessArticle

Pattern-Guided k-Anonymity

Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, Berlin, 10587, Germany
*
Author to whom correspondence should be addressed.
Algorithms 2013, 6(4), 678-701; https://doi.org/10.3390/a6040678
Received: 2 August 2013 / Revised: 9 October 2013 / Accepted: 9 October 2013 / Published: 17 October 2013
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. View Full-Text
Keywords: NP-hardness; parameterized complexity; integer linear programming; exact algorithms; heuristics; experiments NP-hardness; parameterized complexity; integer linear programming; exact algorithms; heuristics; experiments
Show Figures

Figure 1

MDPI and ACS Style

Bredereck, R.; Nichterlein, A.; Niedermeier, R. Pattern-Guided k-Anonymity. Algorithms 2013, 6, 678-701. https://doi.org/10.3390/a6040678

AMA Style

Bredereck R, Nichterlein A, Niedermeier R. Pattern-Guided k-Anonymity. Algorithms. 2013; 6(4):678-701. https://doi.org/10.3390/a6040678

Chicago/Turabian Style

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

Find Other Styles

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Search more from Scilit
 
Search
Back to TopTop