首页 | 本学科首页   官方微博 | 高级检索  
     

基于模糊集的隐私保护方法研究
引用本文:王 茜,杨传栋,刘 泓.基于模糊集的隐私保护方法研究[J].计算机应用研究,2013,30(2):518-520.
作者姓名:王 茜  杨传栋  刘 泓
作者单位:重庆大学计算机学院,重庆,400044
摘    要:在数据发布的隐私保护研究中,针对k-匿名方法的复杂性高、效率低及数据可用性差等问题,从基于模糊集的角度出发进行隐私保护的研究,重点是对数值型属性的处理,提出了基于模糊集的最大隶属度(MMD)算法.该算法对敏感数值型数据进行模糊化处理,把其变成语义型数据,结合隶属度一起发布以达到隐私保护的目的.并通过实验进行了验证,基于模糊集的隐私保护方法与k-匿名方法相比,具有更高的效率,且信息损失要远远小得多,发布数据的可用性更好.

关 键 词:隐私保护  模糊集  模糊化  隶属函数  隶属度  k-匿名

Fuzzy-based methods for privacy preserving
WANG Qian,YANG Chuan-dong,LIU Hong.Fuzzy-based methods for privacy preserving[J].Application Research of Computers,2013,30(2):518-520.
Authors:WANG Qian  YANG Chuan-dong  LIU Hong
Affiliation:College of Computer Science, Chongqing University, Chongqing 400044, China
Abstract:This paper did research based on fuzzy sets to overcome the high complexity, low efficiency and poor data availability of k-anonymity in the research of privacy-preserving data publishing. It focused on the processing of numerical attributes, and proposed the maximal membership degree algorithm. It fuzzed sensitive numerical attributes to semantic data which was released combining with membership degree. Verified through experiments, compared with k-anonymity methods, the MMD has better efficiency, furthermore, its information losses will be far smaller than k-anonymity and the availability of released data is better.
Keywords:privacy preserving  fuzzy sets  fuzzed  membership function  membership degree  k-anonymity
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号