期刊文献+

面向混合型位置大数据的差分隐私聚类算法 被引量:8

Differential privacy clustering algorithm for mixed location big data
下载PDF
导出
摘要 针对现有的差分隐私聚类算法仅局限于实型数据的问题,提出一种基于混合型位置大数据的差分隐私聚类算法DPKD。利用KD-medoids降维聚类算法对混合型位置大数据进行预处理,提取位置信息记录,采用邻近搜索找出聚类中心点,划分为k个聚类簇,添加Laplace噪声使其满足差分隐私,通过查询函数返回待发布的数据记录;分析DPKD算法数据查询误差高的问题,对初始中心点优化选择,提出一种改进的Op-DPKD算法。性能评估结果表明,Op-DPKD算法解决了混合型位置大数据的隐私保护问题,提升了聚类效果,保证了混合型位置大数据的可用性。 Aiming at the problem that the existing differential privacy clustering algorithm is limited to real data,a differential privacy clustering algorithm based on mixed location big data,named as DPKD,was proposed.The KD-medoids dimension reduction clustering algorithm was used to preprocess the mixed location big data and extract the location information recorded from the mixed data set.The proximity search strategy was adopted to find the center point of clustering,which was divided into k clusters,and Laplace noise was added to satisfy the differential privacy protection mechanism.The data recorded to be published were returned through the query function.The problem of higher data query error of DPKD algorithm was analyzed,an improved algorithm named as Op-DPKD was proposed for the optimization of initial center point.The performance evaluation results show that the Op-DPKD algorithm solves the privacy protection problem of mixed location big data and improves the clustering effects,while ensuring the availability of mixed location big data.
作者 张建坤 禹思敏 ZHANG Jian-kun;YU Si-min(School of Automation,Guangdong University of Technology,Guangzhou 510006,China)
出处 《计算机工程与设计》 北大核心 2019年第9期2451-2455,2493,共6页 Computer Engineering and Design
基金 国家自然科学基金重点基金项目(61532020) 国家自然科学基金面上基金项目(61671161)
关键词 混合型位置大数据 差分隐私 聚类算法 隐私保护 数据预处理 mixed location big data differential privacy clustering algorithm privacy protection data preprocessing
  • 相关文献

参考文献7

二级参考文献50

  • 1高小梅,冯云,冯兴杰.增量式K-Medoids聚类算法[J].计算机工程,2005,31(B07):181-183. 被引量:9
  • 2Rui Xu,Donald Wunsch II.Survey of Clustering Algorithms. IEEE Transactions on Neural Networks . 2005
  • 3Harsha S. Nagesh,Sanjay Goil,Alok N. Choudhary.A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets[].International Conference on Parallel Processing.2000
  • 4Zhang T,Ramakrishnan R,Livny M.BIRCH: An efficient data clustering method for very large databases[].Proceedings of ACM-SIGMOD International Conference on Management of Data.1996
  • 5Manyika J,Chui M,Brown B,et al.Big data;the next frontier for innovation,competition,and productivity. . 2011
  • 6CHRISTINAD,REINHARDTBA,KANHERECSS, HOLLICKAM.Asurvey on privacy inmobile participatory sensing applications[J].The Journal of System sand Software. 2011,8(11): 18-22.
  • 7HULLB, BYCHKOVSKYV, ZHANGY, CHENK,M ichel Goraczko AM ,ShihE,BalakrishnanH,MaddenS. Cartel:Adistributed mobile sensor computingsy stem[C]// The 4th ACM International Conferenceon Embedded Networked Sensor Systems, 2006.
  • 8R.AGRAWAL,T.IMIELINSKI,and A.SWAMI.Mining association roles between sets of items in large database[C]. Ptozeedings of the A CM SIGMOD International Conference on Management of Data(SIGMOD' 93),Washington,DC,1993.ACM Press Publisher, 1993:207-216.
  • 9J.S.PARK,M.S.CHEN,and P.S.YU.An Elective Hash Based Algorithm for MiningAssociation Rules[C]. Michael J.Carey and Donovan A.Schneider.Proceedings of the ACM SIGMOD Intertrational Conference on Management of Data(SIGMOD' 95),San Jose, California, 1995. ACM PressPubfisher, 1995:175-186.
  • 10JIAWEI HAN,JIAN PEI,and YIWEN YIN. Mining freqnent patterns without candidate generation[C]. Proceedings of the 2000 ACM-SIGMOD Interational Conference on Management of Data(SIGMOD' 00),Dalla s,Texas,2000.ACM PressPublisher,2000:l-12.

共引文献81

同被引文献88

引证文献8

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部