全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Clustering-based algorithm for data sensitive attributes anonymous protection
基于聚类的数据敏感属性匿名保护算法*

Keywords: sensitive attribute,l-diversity,clustering,information loss
敏感属性
,l-多样性,聚类,信息损失

Full-Text   Cite this paper   Add to My Lib

Abstract:

In order to prevent the disclosure of data sensitive attributes, it requires preserving the anonymity of data sensitive attributes. The current algorithm that has proposed to meet l-diversity is mostly based on the hierarchy, which can lead to unnecessary information loss. For this reason, this paper proposed a clustering-based algorithm for data sensitive attributes anonymous protection, it adopted an improved distance measure method which was from achieving k-anonymity by clustering in attribute hierarchical structures and combined clustering together, the algorithm in accordance with the requirements of l-diversity model clustering of data sets. Experimental results show that the algorithm can not only protect anonymity of sensitive attri-butes in data set, but also reduce the extent of information losses.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133