Please use this identifier to cite or link to this item:
|Title:||Privacypreserving anonymization of set-valued data||Authors:||Terrovitis, M.
|Issue Date:||2008||Citation:||Terrovitis, M.,Mamoulis, N.,Kalnis, P. (2008). Privacypreserving anonymization of set-valued data. Proceedings of the VLDB Endowment 1 (1) : 115-125. ScholarBank@NUS Repository.||Abstract:||In this paper we study the problem of protecting privacy in the publication of set-valued data. Consider a collection of transactional data that contains detailed information about items bought together by individuals. Even after removing all personal characteristics of the buyer, which can serve as links to his identity, the publication of such data is still subject to privacy attacks from adversaries who have partial knowledge about the set. Unlike most previous works, we do not distinguish data as sensitive and non-sensitive, but we consider them both as potential quasi-identifiers and potential sensitive data, depending on the point of view of the adversary. We define a new version of the k-anonymity guarantee, the k m-anonymity, to limit the effects of the data dimensionality and we propose eficient algorithms to transform the database. Our anonymization model relies on generalization instead of suppression, which is the most common practice in related works on such data. We develop an algorithm which finds the optimal solution, however, at a high cost which makes it inapplicable for large, realistic problems. Then, we propose two greedy heuristics, which scale much better and in most of the cases find a solution close to the optimal. The proposed algorithms are experimentally evaluated using real datasets. © 2008 VLDB Endowment.||Source Title:||Proceedings of the VLDB Endowment||URI:||http://scholarbank.nus.edu.sg/handle/10635/39491||ISSN:||21508097|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 28, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.