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

共 11 条

[1] [Anonymous], 2005, CIHR BEST PRACT PROT
[2] Bayardo RJ, 2005, PROC INT CONF DATA, P217
[3] Ciriani V., 2007, SECURE DATA MANAGEME, V33, P323, DOI [10.1007/978-0-387-27696-010, DOI 10.1007/978-0-387-27696-010]
[4] Cox L. H, J AM STAT ASS, P377
[5] LeFevre K., 2005, P ACM MAN DAT BALT M, P43
[6] Li TC, 2006, ICDM 2006: SIXTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, WORKSHOPS, P518
[7] Protecting respondents' identities in microdata release
Samarati, P
[J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2001, 13 (06) : 1010 - 1027
[8] k-anonymity:: A model for protecting privacy
Sweeney, L
[J]. INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2002, 10 (05) : 557 - 570
[9] Sweeney L., 2002, INT J UNCERTAIN FUZZ, V10, P18
[10] Willenborg L., 1996, LECT NOTES STAT, V11

← 1 2 →