期刊文献+

融合微聚集隐私保护的协同过滤算法研究 被引量:2

Research on microaggregation fused collaborative filtering algorithm for privacy protection
下载PDF
导出
摘要 现有的k-匿名隐私保护是一种安全有效的隐私保护算法,针对其对背景知识攻击和同质性攻击防范的不足,提出一种基于敏感属性多样性的微聚集隐私保护的协同过滤算法。算法在满足k-匿名的前提下,融入敏感属性的多样性,在微聚集算法中通过设置同一等价类中敏感属性的差异值,来避免敏感属性值过于接近而造成隐私泄露,从而达到保护隐私数据的目的,同时保证推荐的准确性。实验结果表明,该算法既能保证为用户提供高效的个性化推荐,又能够产生安全的信息表。 As a safe and effective privacy protection algorithm,the existing k-anonymous privacy protection still has some insufficiency caused by background knowledge attack and homogeneity attack. Therefore,a sensitive attribute diversity based microaggregation collaborative filtering algorithm for privacy protection is proposed. On the premise of meeting the k-anonymity requirement,the sensitive attribute diversity is fused into the algorithm. The difference values of sensitive attributes in the same equivalence class are set in the microaggregation algorithm to avoid too close sensitive attribute values which can cause privacy disclosure,so as to achieve the purpose of protecting the privacy data and ensure the accuracy of recommendation. The experimental results show that the algorithm can not only guarantee to provide users with efficient personalized recommendation,but also generate safe information tables.
出处 《现代电子技术》 北大核心 2018年第6期5-10,共6页 Modern Electronics Technique
基金 国家自然科学基金项目(61462079) 国家自然科学基金项目(61262088) 国家自然科学基金项目(61562086) 国家自然科学基金项目(61363083)~~
关键词 推荐系统 微聚集 协同过滤 K-匿名化 隐私泄露 隐私保护 recommendation system microaggregation collaborative filtering k-anonymity privacy disclosure privacy protection
  • 相关文献

参考文献8

二级参考文献91

  • 1王廷,喻建平,杨懿竣.一种用于云隐私保护的线性同态加密方案[J].新型工业化,2013,2(1):60-67. 被引量:6
  • 2潘晓,肖珍,孟小峰.位置隐私研究综述[J].计算机科学与探索,2007,1(3):268-281. 被引量:65
  • 3张光卫,李德毅,李鹏,康建初,陈桂生.基于云模型的协同过滤推荐算法[J].软件学报,2007,18(10):2403-2411. 被引量:191
  • 4Goldberg D, Nichols D, Oki B M, et al. Using collaborative filtering to weave an information tapestry[J]. Communica- tions of the ACM, 1992, 35(12):61-70.
  • 5Resnick P, Iacovou N, Suchak M, et al. GroupLens: An open architecture for collaborative filtering of netnews[C],// Proc of 1994 ACM Conference on Computer Supported Coop- erative Work, 1994:175-186.
  • 6Konstan J A, Miller B N, Maltz D, et al. GroupLens:Ap- plying collaborative filtering to Usenet news[J].Communi- cations of the ACM, 1997, 40(3):77-87.
  • 7Linden G, Smith B, York J. Amazon. eom recommendations: Item-to-item collaborative filtering[J]. IEEE Internet Com- puting, 2003, 7(1) :76-80.
  • 8Zhou Y, Wilkinson D, Schreiber R, et al. Large-scale paral- lel collaborative filtering for the netflix prize[M]//Proc of the 4th International Conference on Algorithmic Aspects in In- formation and Management, 2008 : 337-348.
  • 9Lee D. How to measure the information similarity in unilat- eral relations:the case study of delicious[C] //Proc of the In- ternational Workshop on Modeling Social Media, 2010:1 4.
  • 10Balabanovic M, Shoham Y. Fab:Content-based, collabora- tive recommendation [J]. Communications of the ACM, 1997, 40(3) :66-72.

共引文献194

同被引文献19

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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