Research on K-Anonymity Algorithm in Privacy Protection

DOI

10.2991/iccia.2012.47How to use a DOI?

Keywords

privacy,privacy protection,k-anonymity,clustering

Abstract

Nowadays, people pay great attention to the privacy protection, therefore the technology of anonymization has been widely used. However, most of current methods strictly depend on the predefined ordering relation on the generalization layer or attribute domain, making the anonymous result is a high degree of information loss, thereby reducing the availability of data. In order to solve the problem, we propose a K-Members Clustering Algorithm to reduce the information loss, and improve the performance of k-anonymity in privacy protection.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Chen Wang
AU  - Lianzhong Liu
AU  - Lijie Gao
PY  - 2014/05
DA  - 2014/05
TI  - Research on K-Anonymity Algorithm in Privacy Protection
BT  - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012)
PB  - Atlantis Press
SP  - 194
EP  - 196
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccia.2012.47
DO  - 10.2991/iccia.2012.47
ID  - Wang2014/05
ER  -