Research on K-Anonymity Algorithm in Privacy Protection

摘要：

　　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 availabifity 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.

关键词： privacy privacy protection k-anonymity clustering

作者: Chen Wang Lianzhong Liu Lijie Gao

作者单位: School of Computer Science and Engineering, Key Laboratory of Beijing Network Technology, Beihang University, Beijing, 100191 China

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer and Information Applications(ICCIA2012)(2012第二届计算机和信息应用国际会议)

会议地点: 太原

会议语种:英文

页码: 194-196

在线出版日期: 2012-12-08（万方平台首次上网日期，不代表论文的发表时间）