Privacy Problems with Anonymized Transaction Databases

  • Taneli Mielikäinen
Conference paper

DOI: 10.1007/978-3-540-30214-8_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3245)
Cite this paper as:
Mielikäinen T. (2004) Privacy Problems with Anonymized Transaction Databases. In: Suzuki E., Arikawa S. (eds) Discovery Science. DS 2004. Lecture Notes in Computer Science, vol 3245. Springer, Berlin, Heidelberg

Abstract

In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In particular, we show how an anonymized transaction database can be deanonymized using non-anonymized frequent itemsets. We describe how the problem can be formulated as an integer programming task, study the computational complexity of the problem, discuss how the computations could be done more efficiently in practice and experimentally examine the feasibility of the proposed approach.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Taneli Mielikäinen
    • 1
  1. 1.HIIT Basic Research Unit, Department of Computer ScienceUniversity of HelsinkiFinland

Personalised recommendations