期刊文献+

大数据云环境下TDS和BUG混合k-匿名化方法

Hybrid k-anonymity approach based on TDS and BUG under the environment of big data cloud
下载PDF
导出
摘要 针对一般子树匿名化方法处理大数据效率低和伸缩性较差的问题,提出了一种可伸缩的自下向上的泛化(BUG)方法,并在此基础上,结合已有的自上向下的特化(TDS),形成一种混合方法。在提出的方法中,k-匿名作为隐私模型,TDS和BUG都是基于映射化简开发组成,并通过云的强大计算能力来获得较高的伸缩性。提出的映射化简BUG只需在几次泛化循环之后就可插入一个新的泛化候选,不会影响另一个泛化的信息损失。考虑到工作负载平衡点K与匿名参数k的复杂关系,将映射化简的BUG和TDS结合形成混合方法。实验结果验证了本文方法的有效性,与TDS和BUG相比,混合方法的效率和可伸缩性大为提高。 As the issue of low efficiency and poor scalability in general sub-tree anonymous method of treating big data, a bottom-up generalization (BUG) method with scalability was proposed, and on this basis, combined with the existing top-down specialization(TDS), a hybrid approach was formed. In the proposed method, k-anonymity was being as a privacy model, the compositions of TDS and BUG were developed with mapping simplification, and higher scalability through powerful cloud computing capabilities were achieved. The proposed mapping simplification BUG could insert a new candidate after several cycles of generalization, and would not affect information loss of another generalization. Given the complexity of the relationship between workload balancing point K and anonymous parameter k, mapping simplifications of BUG and TDS were combined to form a hybrid approach. Experimental results demonstrate the effectiveness of the proposed method and compared with TDS and BUG, the efficiency and scalability of hybrid method are greatly improved.
出处 《电信科学》 北大核心 2016年第7期90-96,共7页 Telecommunications Science
关键词 云计算 子树匿名化 大数据 泛化 特化 映射化简 cloud computing, sub-tree anonymous, big data, generalization, specialization, mapping simplification
  • 相关文献

参考文献5

二级参考文献43

  • 1张引,陈敏,廖小飞.大数据应用的现状与展望[J].计算机研究与发展,2013,50(S2):216-233. 被引量:375
  • 2Truta T N, Fotouhi F, Barth-Jones D. Privacy and Confidentiality Management for the Microag-gregation Disclosure Control Method: Disclosure Risk and Information Loss Measures[C]//Proceedings of WPES'03. New York, USA: ACM Press, 2003: 21-29.
  • 3Meyerson A, Williams R. On the Complexity of Optimal K-anonymity[C]//Proceedings of the ACM SIGMOD-SIGACTSIGART Conf. on Principles of Database Systems. New York, USA: ACM Press, 2004: 223-228.
  • 4Aggarwal G, Feder T. Approximation Algorithms for K-anonymity[J]. Journal of Privacy Technology, 2005, 12(1 ): 78-94.
  • 5Sweeney L. Guaranteeing Anonymity When Sharing Medical Data, the Datafly System[C]//Proceedings of the AMIA Annual Fall Symposium. Nashville, TN: [s. n.], 1997: 51-55.
  • 6LeFevre K, DeWitt D, Ramakrishnan R. Incognito: Efficient Full-domain K-anonymity[C]//Proceedings of the ACM SIGMOD International Conference on Management of Data. New York, USA: ACM Press, 2005: 49-60.
  • 7Sweeney L. Achieving K-anonymity Privacy Protection Using Generalization and Suppression[J]. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 2002, 10(5): 571-588.
  • 8商晓帆.电子政务信息资源管理机制研究[J].图书馆学研究,2007(9):72-74. 被引量:5
  • 9丁杰,李莹,夏英成.发展农业信息服务业推进农业信息化建设[J].现代情报,2007,27(11):61-62. 被引量:11
  • 10Shim K.Map Reduce algorithms for big data analysis,and storage of big data.Proceedings of the VLDB Endowment,Istanbul,Turkey,2012.

共引文献61

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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