DocumentCode :
2485409
Title :
Multi-Attribute Generalization Method in Privacy Preserving Data Publishing
Author :
Yu, Wen-Bing ; Lv Pin ; Chen, Nian-Sheng
Author_Institution :
Hubei Province Key Lab. of Intell. Robot, Wuhan Insititute of Technol., Wuhan, China
fYear :
2010
fDate :
22-23 May 2010
Firstpage :
1
Lastpage :
4
Abstract :
K-anonymization is a technique that prevents linking attacks by generalizing and suppressing portions of the released raw data so that no individual can be uniquely distinguished from a group of size of k. In this paper, we study single-attribute generalization for preserving privacy in publishing of sensitive data, and present multi-attribute generalization definition in process of generalization based Datafly algorithm. Besides we describe how to generate multi-attribute attribute generalization hierarchy. A key question is how to anonymize the microdata so that it can be multi-attribute attribute generalization hierarchy. We introduce the join, pune and create edge, as a way to reduce search space of k-anonymization, and propose a scalable and practical solution.
Keywords :
data mining; data privacy; generalisation (artificial intelligence); publishing; k-anonymization; multiattribute generalization; privacy preserving data publishing; Computer science; Data engineering; Data mining; Data privacy; Educational institutions; Intelligent robots; Joining processes; Laboratories; Lattices; Publishing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
e-Business and Information System Security (EBISS), 2010 2nd International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-5893-6
Electronic_ISBN :
978-1-4244-5895-0
Type :
conf
DOI :
10.1109/EBISS.2010.5473616
Filename :
5473616
Link To Document :
بازگشت