Abstract. Individual privacy will be at risk if a published data set is not properly deidentified. k-anonymity is a major technique to de-identify a data set. A more general view of k-anonymity is clustering with a constraint of the minimum number of objects in every cluster. Most existing approaches to achieving k-anonymity by clustering are for numerical (or ordinal) attributes. In this paper, we study achieving k-anonymity by clustering in attribute hierarchical structures. We define generalisation distances between tuples to characterise distortions by generalisations and discuss the properties of the distances. We conclude that the generalisation distance is a metric distance. We propose an efficient clustering-based algorithm for k-anonymisation. We experimentally show that the proposed method is more scalable and causes significantly less distortions than an optimal global recoding k-anonymity method.
Jiuyong Li et al REF proposed to achieve kanonymity by Clustering in Attribute Hierarchical Structures.
Achieving k-anonymity by clustering in attribute hierarchical structures
in ‘Proceesing of 8th International Conference on Data Warehousing and Knowledge Discovery
Computer Science