Abstract
This paper discusses a problem arising in the field of privacy-protection in statistical databases: Given a \(n\!\times\! m \ \{0,1\}\)-matrix M, is there a set of mergings which transforms M into a zero matrix and only affects a bounded number of rows/columns. “Merging” here refers to combining adjacent lines with a component-wise logical AND. This kind transformation models a generalization on OLAP-cubes also called global recoding. Counting the number of affected lines presents a new measure of information-loss for this method. Parameterized by the number of affected lines k we introduce reduction rules and an \(\mathcal{O}^*(2.618^k)\)-algorithm for the new abstract combinatorial problem LMAL.
Partially funded by a PhD-scholarship of the DAAD.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Branković, L., Fernau, H.: Approximability of a {0,1}-matrix problem. In: Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms, pp. 39–45 (2005)
Branković, L., Horak, P., Miller, M.: A Combinatorial Problem in Database Security. Discrete Applied Mathematics 91(1-3), 119–126 (1999)
Branković, L., Giggins, H.: Security of Statistical Databases. In: Petkovic, M., Jonker, W. (eds.) Security, Privacy and Trust in Modern Data Management, pp. 167–182. Springer (2007)
Bredereck, R., Nichterlein, A., Niedermeier, R.: Pattern-Guided k-Anonymity. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol. 7924, pp. 350–361. Springer, Heidelberg (2013)
Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)
Evans, P., Wareham, T., Chaytor, R.: Fixed-parameter tractability of anonymizing data by suppressing entries. Journal of Combinatorial Optimization 18(4), 362–375 (2009)
Fernau, H.: Complexity of a {0,1}-matrix problem. The Australasian Journal of Combinatorics 29, 273–300 (2004)
Karp, R.: Reducibility among Combinatorial Problems. Complexity of Computer Computations, 85–103 (1972)
Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.:l-Diversity: Privacy Beyond k-Anonymity. ACM Transactions on Knowledge Discovery from Data 1(1) (2007)
Samarati, P.: Protecting Respondents’ Identities in Microdata Release. IEEE Transactions on Knowledge and Data Engineering 13(6), 1010–1027 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Casel, K. (2014). A Fixed-Parameter Approach for Privacy-Protection with Global Recoding. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-08016-1_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08015-4
Online ISBN: 978-3-319-08016-1
eBook Packages: Computer ScienceComputer Science (R0)