Title :
A novel algorithm of personalized-granular k-anonymity
Author :
Yanguang Shen ; Gaoshang Guo ; Di Wu ; Yongjian Fan
Author_Institution :
Coll. of Inf. & Electron. Eng., Hebei Univ. of Eng., Handan, China
Abstract :
In the existing anonymous privacy protection technology, there is a shortage of personalized privacy protection support for sensitive attributes before data publishing and sharing. In order to achieve more reasonable personalized privacy preservation and improve the precision of privacy preservation, this paper reviewed the latest researches in granular computing theory, rough set theory and k-anonymity theory, and presented a novel algorithm of personalized-granular k-anonymity based on the personalized decision degree of privacy preservation, in view of different personalized granularity decision selectivity of privacy preservation in E-business. It has been experimentally proved that the novel algorithm can achieve privacy preservation with more reasonable personalization, and its accuracy of privacy preservation is superior to p-sensitive k-anonymity algorithm.
Keywords :
business data processing; data protection; granular computing; rough set theory; anonymous privacy protection technology; data publishing; data sharing; e-business; granular computing theory; k-anonymity theory; personalized decision degree; personalized granularity decision selectivity; personalized privacy preservation precision improvement; personalized privacy protection; personalized-granular k-anonymity; rough set theory; sensitive attributes; Accuracy; Clustering algorithms; Data privacy; Privacy; Sensitivity; Silicon; granular computing; k-anonymity; personalized granularity; privacy preservation; rough set;
Conference_Titel :
Mechatronic Sciences, Electric Engineering and Computer (MEC), Proceedings 2013 International Conference on
Conference_Location :
Shengyang
Print_ISBN :
978-1-4799-2564-3
DOI :
10.1109/MEC.2013.6885357