20 20

Transactions on
Data Privacy
Foundations and Technologies

http://www.tdp.cat


Articles in Press

Accepted articles here

Latest Issues

Year 2024

Volume 17 Issue 1

Year 2023

Volume 16 Issue 3
Volume 16 Issue 2
Volume 16 Issue 1

Year 2022

Volume 15 Issue 3
Volume 15 Issue 2
Volume 15 Issue 1

Year 2021

Volume 14 Issue 3
Volume 14 Issue 2
Volume 14 Issue 1

Year 2020

Volume 13 Issue 3
Volume 13 Issue 2
Volume 13 Issue 1

Year 2019

Volume 12 Issue 3
Volume 12 Issue 2
Volume 12 Issue 1

Year 2018

Volume 11 Issue 3
Volume 11 Issue 2
Volume 11 Issue 1

Year 2017

Volume 10 Issue 3
Volume 10 Issue 2
Volume 10 Issue 1

Year 2016

Volume 9 Issue 3
Volume 9 Issue 2
Volume 9 Issue 1

Year 2015

Volume 8 Issue 3
Volume 8 Issue 2
Volume 8 Issue 1

Year 2014

Volume 7 Issue 3
Volume 7 Issue 2
Volume 7 Issue 1

Year 2013

Volume 6 Issue 3
Volume 6 Issue 2
Volume 6 Issue 1

Year 2012

Volume 5 Issue 3
Volume 5 Issue 2
Volume 5 Issue 1

Year 2011

Volume 4 Issue 3
Volume 4 Issue 2
Volume 4 Issue 1

Year 2010

Volume 3 Issue 3
Volume 3 Issue 2
Volume 3 Issue 1

Year 2009

Volume 2 Issue 3
Volume 2 Issue 2
Volume 2 Issue 1

Year 2008

Volume 1 Issue 3
Volume 1 Issue 2
Volume 1 Issue 1


Volume 15 Issue 3


Improving Data Utilization of K-anonymity through Clustering Optimization

Hewen Wang(a), Jingsha He(a), Nafei Zhu(a),(*)

Transactions on Data Privacy 15:3 (2022) 177 - 192

Abstract, PDF

(a) Faculty of Information Technology, Beijing University of Technology, Beijing, 100124, China.

e-mail:hewenwang @emails.bjut.edu.cn; jhe @bjut.edu.cn; znf @bjut.edu.cn


Abstract

K-anonymity privacy protection model demonstrates good performance in privacy protection and, has been widely applied in such scenarios as data publishing, location-based services, and social networks. With the aim of ensuring k-anonymity to conform to the requirements of privacy protection with improved data utilization, this study proposes a k-anonymity algorithm based on central point clustering, so as to improve the quality of clustering through optimizing the selection of cluster centroids, leading to the improvement in effectiveness and efficiency of k-anonymity. After clustering, the quasi-identifier attributes are aligned for classification and generalization, which is evaluated using appropriate information loss metrics. To measure the distance between records and between records and clusters, this study also establishes a definition of such distance that is positively correlated to the amount of information that is lost by combining the characteristics of the depth and width of the generalization hierarchy, in an effort to improve of the utility of the algorithm. The experimental results show that the proposed algorithm not only meets the basic anonymity requirements, but also improves data utilization compared with some prevailing algorithms.

* Corresponding author.

Follow us




Supports



ISSN: 1888-5063; ISSN (Digital): 2013-1631; D.L.:B-11873-2008; Web Site: http://www.tdp.cat/
Contact: Transactions on Data Privacy; Vicenç Torra; Umeå University; 90187 Umeå (Sweden); e-mail:tdp@tdp.cat
Note: TDP's web site does not use cookies. TDP does not keep information neither on IP addresses nor browsers. For the privacy policy access here.

 


Vicenç Torra, Last modified: 15 : 46 December 23 2022.