期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
An Efficient Clustering Algorithm for k-Anonymisation 被引量:4
1
作者 grigorios loukides 《Journal of Computer Science & Technology》 SCIE EI CSCD 2008年第2期188-202,共15页
K-anonymisation is an approach to protecting individuals from being identified from data. Good k-anonymisations should retain data utility and preserve privacy, but few methods have considered these two conflicting re... K-anonymisation is an approach to protecting individuals from being identified from data. Good k-anonymisations should retain data utility and preserve privacy, but few methods have considered these two conflicting requirements together. In this paper, we extend our previous work on a clustering-based method for balancing data utility and privacy protection, and propose a set of heuristics to improve its effectiveness. We introduce new clustering criteria that treat utility and privacy on equal terms and propose sampling-based techniques to optimally set up its parameters. Extensive experiments show that the extended method achieves good accuracy in query answering and is able to prevent linking attacks effectively. 展开更多
关键词 k-anonymisation data privacy greedy clustering
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部