首页    期刊浏览 2024年11月24日 星期日
登录注册

文章基本信息

  • 标题:An Approach to Achieving K-partition for Preserving Privacy by Using Multi-constraint Anonymous Parameter Based on Rough Sets
  • 本地全文:下载
  • 作者:Liu, Tao ; Qiu, Taorong ; Duan, Wenying
  • 期刊名称:Journal of Computers
  • 印刷版ISSN:1796-203X
  • 出版年度:2014
  • 卷号:9
  • 期号:10
  • 页码:2493-2499
  • DOI:10.4304/jcp.9.10.2493-2499
  • 语种:English
  • 出版社:Academy Publisher
  • 摘要:We propose an approach to achieving different K -partition for preserving privacy by using the multi-constraint anonymous parameter design method based on the attribute significance of rough set, in order to reduce the imbalance phenomenon between the privacy protection and data availability caused by adopting the same anonymous intensity. In this approach, taking into account the significance of quasi-identifier attributes, we carry out the dimension division automatically and obtain multi-constraint anonymous parameters. After that an anonymous algorithm is executed on the separate partition. Experimental results show that the proposed method can obtain a better balance between the privacy protection degree and data availability.
  • 关键词:Privacy Preservation;Anonymous Parameters; Rough Set; Attribute Significance
国家哲学社会科学文献中心版权所有