Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

PCTA: privacy-constrained clustering-based transaction data anonymization

Gkoulalas-Divanis, Aris and Loukides, Grigorios ORCID: https://orcid.org/0000-0003-0888-5061 2011. PCTA: privacy-constrained clustering-based transaction data anonymization. Presented at: 4th International Workshop on Privacy and Anonymity in the Information Society (PAIS '11), Uppsala, Sweden, 25 March 2011. Published in: Truta, T. M., Xiong, L., Fotouh, F., Orsborn, K. and Stefanova, S. eds. PAIS '11: Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society. New York: ACM, 10.1145/1971690.1971695

Full text not available from this repository.

Abstract

Transaction data about individuals are increasingly collected to support a plethora of applications, spanning from marketing to biomedical studies. Publishing these data is required by many organizations, but may result in privacy breaches, if an attacker exploits potentially identifying information to link individuals to their records in the published data. Algorithms that prevent this threat by transforming transaction data prior to their release have been proposed recently, but incur significant information loss due to their inability to accommodate a range of different privacy requirements that data owners often have. To address this issue, we propose a novel clustering-based framework to anonymizing transaction data. Our framework provides the basis for designing algorithms that explore a larger solution space than existing methods, which allows publishing data with less information loss, and can satisfy a wide range of privacy requirements. Based on this framework, we develop PCTA, a generalization-based algorithm to construct anonymizations that incur a small amount of information loss under many different privacy requirements. Experiments with benchmark datasets verify that PCTA significantly outperforms the current state-of-the-art algorithms in terms of data utility, while being comparable in terms of efficiency.

Item Type: Conference or Workshop Item (Paper)
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: ACM
ISBN: 9781450306119
Last Modified: 21 Oct 2022 08:40
URI: https://orca.cardiff.ac.uk/id/eprint/34068

Citation Data

Cited 6 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item