Study on Privacy Protection Algorithm Based on K-Anonymity

被引：0

作者：

Zhao FeiFei ^{[1
]}

Dong LiFeng ^{[2
]}

Wang Kun ^{[2
]}

Li Yang ^{[2
]}

机构：

[1] Tianjin Univ, Sch Comp Sci & Technol, Tianjin, Peoples R China

[2] Mil Transportat Univ, Postgrad Training Brigade, Tianjin, Peoples R China

来源：

2011 AASRI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND INDUSTRY APPLICATION (AASRI-AIIA 2011), VOL 1 | 2011年

关键词：

K_Anonymity; Degree First; Subset; Two Times K-Anonymity; Privacy Protection;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Basing on the study of K-Anonymity algorithm in privacy protection issue, this paper proposed a "Degree Priority" method of visiting Lattice nodes on the generalization tree to improve the performance of K-Anonymous algorithm. This paper also proposed a "Two Times K-anonymous" methods to reduce the information loss in the process of K-Anonymity. Finally, we used experimental results to demonstrate the effectiveness of these methods.

引用

页码：312 / 315

页数：4