.png){kind=icon}
返回
Clustering-oriented privacy-preserving data publishing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2012.05.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Privacy-preserving data publishing has attracted considerable research interests in recent years. One of the problems in such practices is how to trade-off between data utility and privacy protection. This problem heavily deteriorates when the published data are used to do cluster analysis; clustering demands differences between singles for grouping while privacy preserving aims to hide single identifications. In this paper, a mixed mode data obfuscation method AENDO is proposed, which provides a tradeoff strategy from a novel view. The underlying principle is to keep nearest neighborhood structures of data points while data are obfuscated. In particular, for each data point, AENDO differentiates its attributes into neighboring dispersed attributes and neighboring concentrated ones. Furthermore, pertinent statistical data substitution and data swapping strategies are applied to these attributes, respectively. An extensive set of experiments on UCI data sets are provided to assess the effectiveness of our solution, including comparing AENDO with RBT which is one of the best methods on maintaining data usability for clustering. Our results demonstrate that AENDO behaves similarly with RBT on maintaining data utility for clustering, while it outperforms NeNDS by a factor of approximate 10%. Meanwhile, it delivers better anti-inferring effect compared with RBT and NeNDS. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Data obfuscation
Neighboring dispersed attribute
Neighboring concentrated attribute
k Nearest neighborhood
Entropy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容