Capturing data usefulness and privacy protection in K-anonymisation

Loukides, Grigorios ORCID: https://orcid.org/0000-0003-0888-5061 and Shao, Jianhua ORCID: https://orcid.org/0000-0001-8461-1471 2007. Capturing data usefulness and privacy protection in K-anonymisation. Presented at: 22nd Annual ACM Symposium on Applied Computing, Seoul, Korea, 11-15 March 2007. SAC '07 Proceedings of the 2007 ACM Symposium on Applied Computing. New York, NY: ACM, pp. 370-374. 10.1145/1244002.1244091

Full text not available from this repository.

Abstract

K-anonymisation is an approach to protecting privacy contained within a data set. A good k-anonymisation algorithm should anonymise a data set in such a way that private information contained within it is hidden, yet anonymised data is still useful in intended applications. Maximising both data usefulness and privacy protection in k-anonymisation is however difficult. In this paper, we suggest a metric that attempts to quantify these two properties and introduce a clustering based algorithm that can achieve a balance between them in k-anonymisation.

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:	9781595934802
Last Modified:	24 Oct 2022 10:33
URI:	https://orca.cardiff.ac.uk/id/eprint/44831

Citation Data

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

Actions (repository staff only)

Edit Item