This paper tackles the topic of data anonymization from a vector quantization point of view. The admitted goal in this work is to provide means of performing data anonymization to avoid single individual or group re-identification from a data set, while maintaining as much as possible (and in a very specific sense) data integrity and structure. The structure of the data is first captured by clustering (with a vector quantization approach), and we propose to use the properties of this vector quantization to anonymize the data. Under some assumptions over possible computations to be performed on the data, we give a framework for identifying and “pushing back outliers in the crowd”, in this clustering sense, as well as anonymizing cluster members while preserving cluster-level statistics and structure as defined by the assumptions (density, pairwise distances, cluster shape and members...).
|Titel på gästpublikation||CD-ARES 2016: Availability, Reliability, and Security in Information Systems|
|Status||Publicerad - 23.08.2016|
|MoE-publikationstyp||A4 Artikel i en konferenspublikation|
|Namn|| Lecture Notes in Computer Science book series (LNCS)|