首页 | 官方网站   微博 | 高级检索  
     

差分隐私保护k- means聚类方法研究
引用本文:李杨,郝志峰,温雯,谢光强.差分隐私保护k- means聚类方法研究[J].计算机科学,2013,40(3):287-290.
作者姓名:李杨  郝志峰  温雯  谢光强
作者单位:(广东工业大学自动化学院 广州510006) (广东工业大学计算机学院 广州510006)
摘    要:研究了基于差分隐私保护的k-means聚类隐私保护方法。首先介绍了隐私保护数据挖掘和隐私保护聚类分析的研究现状,简单介绍了差分隐私保护的基本原理和方法。为了解决差分隐私k-means聚类方法聚类结果可用性差的问题,提出了一个新的IDP k-means聚类方法,并证明了其满足e-差分隐私保护。最后的仿真实验表明,在相同隐私保护级别下,IDP k-means聚类方法与差分隐私k-means聚类方法相比,聚类可用性得到了较大程度的提高。

关 键 词:差分隐私,k一均值,聚类,隐私保护

Research on Differential Privacy Preserving k-means Clustering
Affiliation:(School of Automation,Guangdong University of Technology,Uuangzhou 510006,China)(School of Computers,Guangdong University of Technology,Guangzhou 510006,China)
Abstract:We studied k-means privacy preserving clustering method within the framework of differential privacy. We first introduced the research status of privacy preserve data mining and privacy preserve clustering, briefly presenting the basic principle and method of differential privacy. To improve the poor clustering availability of differential privacy k-means, we presented a new method of IDP k-means clustering and proved it satisfies E-differential privacy. Our experimenu show that at the same level of privacy preserve, IDP k-means clustering gets a much higher clustering availability than differential privacy k-means clustering method.
Keywords:Differential privacy  k-mcans  Clustering  Privacy preserving
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号