【24h】

Generating k-Anonymous Microdata by Fuzzy Possibilistic Clustering

机译:通过模糊可能性聚类生成k-匿名微数据

获取原文

摘要

Collecting, releasing and sharing microdata about individuals is needed in some domains to support research initiatives aiming to create new valuable knowledge, by means of data mining and analysis tools. Thus, seeking individuals' anonymity is required to guarantee their privacy prior publication. The k-anonymity by microaggrega-tion, is a widely accepted model for data anonymization. It consists in de-associating the relationship between the identity of data subjects, i.e. individuals, and their confidential information. However, this method shows limits when dealing with real datasets. Indeed, the latter are characterized by their large number of attributes and the presence of noisy data. Thus, decreasing the information loss during the anonymization process is a compelling task to achieve. This paper aims to deal with such challenge. Doing so, we propose a microaggregation algorithm called Micro-PFSOM, based on fuzzy possibilitic clustering. The main thrust of this algorithm stands in applying an hybrid anonymization process.
机译:在某些领域,需要收集,发布和共享有关个人的微数据,以支持旨在通过数据挖掘和分析工具来创造新的有价值知识的研究计划。因此,需要寻求个人的匿名性,以保证他们的隐私权在出版之前。通过微聚合的k匿名性是一种广泛接受的数据匿名化模型。它在于取消关联数据主体(即个人)的身份与其机密信息之间的关系。但是,此方法在处理实际数据集时显示出局限性。的确,后者的特征在于它们的大量属性和嘈杂数据的存在。因此,减少匿名过程中的信息丢失是一项令人信服的任务。本文旨在应对此类挑战。为此,我们提出了一种基于模糊可能聚类的微聚合算法,称为Micro-PFSOM。该算法的主要目的在于应用混合匿名化过程。

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号