期刊文献+

一种改进的隐私保护关联规则挖掘算法 被引量:3

Improved Algorithm of Privacy Preserving Association Rule Mining
下载PDF
导出
摘要 部分隐藏的随机化回答方法是基于关联规则数据挖掘的隐私保护算法,针对该算法在重构频繁项集支持度上的指数级时间复杂度导致算法执行效率下降的不足,采用分治策略和集合运算方法对该算法进行改进,消除重构数据的指数级运算。改进算法降低了算法的时间复杂度并有效提高了执行效率。仿真实验与分析表明了改进算法的有效性。 Randomized response with partial hiding is a privacy preservation algorithm based on associa- tion rule mining. For the insufficient that the exponential time complexity of the algorithm in the recon- struction of frequent item set support reduces the execution efficiency of the algorithm, the divide and conquer strategy and the set operations are used to improve the algorithm, and the exponential computa- tion in the reconstruction is eliminated. The improved algorithm can reduce the time complexity and promote the efficiency effectively. Experiments and analysis indicate the effectiveness of the improved algorithm.
出处 《南京航空航天大学学报》 EI CAS CSCD 北大核心 2015年第1期119-124,共6页 Journal of Nanjing University of Aeronautics & Astronautics
关键词 关联规则 隐私保护 分治策略 集合运算 association rules privacy preservation divide and conquer strategy set operations
  • 相关文献

参考文献12

二级参考文献63

  • 1黄毅群,卢正鼎,胡和平,李瑞轩.分布式环境下保持隐私的关联规则挖掘算法[J].计算机工程,2006,32(13):12-14. 被引量:7
  • 2张鹏,童云海,唐世渭,杨冬青,马秀莉.一种有效的隐私保护关联规则挖掘方法[J].软件学报,2006,17(8):1764-1774. 被引量:53
  • 3陈晓明,李军怀,彭军,刘海玲,张璟.隐私保护数据挖掘算法综述[J].计算机科学,2007,34(6):183-186. 被引量:16
  • 4Vaidya J, Clifton C W. Privacy Preserving Association Rule Mining in Vertically Partitioned Data[C]//Proceedings of the 8th ACM International Conference on Knowledge Discovery and Data Mining. Alberta, Canada: [s. n.], 2002: 639-644.
  • 5Beaver D. Commodity-based Cryptography(Extended Abstract)[C]// Proceedings of the 29th Annual ACM Symposium on Theory of Computing. TX, USA: [s. n.], 1997: 217-221.
  • 6Beaver D. Server-assisted Cryptography[C]//Proceedings of the 1998 New Security Paradigms Workshop. Charlottesville, VA, USA:[s. n.], 1998: 92-106.
  • 7Yao A C. How to Generate and Exchange Secrets[C]//Proceedings of the 27th IEEE Symposium on Foundations of Computer Science. Los Alamitos. USA: [s. n.], 1986: 162-167.
  • 8Goldreich O, Micali S. How to Play any Mental Game-A Completeness Theorem for Protocols with Honest Majority[C]// Proceedings of the 19th ACM Symposium on the Theory of Computing. New York, USA: [s. n.], 1987: 218-229.
  • 9Atallah M J. Secure Multi-party Computational Geometry[C]// Proceedings of the 7th International Workshop on Algorithms and Data Structures. Providence, Rhode Island, USA: [s. n.], 2001: 165-179.
  • 10Verykios V S,Bertino E,Fovino I N,et al.State-of-the-art in privacy preserving data mining[J].SIGMOD Record, 2004,33 ( 1 ) : 50-57.

共引文献247

同被引文献31

引证文献3

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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