期刊文献+

基于用户兴趣和双重聚类融合的协同过滤算法的优化研究 被引量:2

Research on Collaborative Filtering Algorithm and Optimization of Fusion and Double Clustering Based on User Interest
下载PDF
导出
摘要 协同过滤技术是目前应用最多的一种推荐技术,这项技术从用户提供的信息中展开发掘,按"物以类聚,人以群分"的原则产生和目标用户(或项目)相似性高的最近邻,从中预测评分,进而产生推荐。但是由于评分信息稀疏化就会造成无法适应用户兴趣,而且推荐的实时性差等问题。针对上述问题,文章提出了一种带有改进的用户-项目类型喜好相似性的计算方法完善用户兴趣改变的问题,并且结合了优化后的双重k-means聚类,使搜索最近邻的范围大大减少,从而提高了推荐算法的实时性。实验结果表明,该优化后的协同过滤推荐算法能通过时间相似性更好地适应用户兴趣的变化,推荐的精度最精确,效果更易使用户满意。 Collaborative ifltering technology is a kind of recommendation technologies currently used the most, discovery of this technology from the information provided by the user, according to the "Like attracts like., produce Birds of a feather lfock together." principle and target users (or items) nearest neighbor similarity is high, a predictive score from birth, and then recommend. But the score information sparse will result can not adapt to the user interest, problems and poor real-time recommendation. Aiming at the above problems, this paper proposes a with an improved user item type preferences similarity calculation method to improve user interest change problem, and combined with the dual K-means clustering after optimization, the scope of the nearest neighbor search is greatly reduced, thus improving the real-time performance of the recommendation algorithm. The experimental results show that, collaborative ifltering recommendation algorithm of the optimized through time similarity to better adapt to the changes of the user's interests, the most accurate recommendation accuracy, easy to use user satisfaction effect.
作者 翟烁
出处 《无线互联科技》 2015年第5期124-127,共4页 Wireless Internet Technology
关键词 协同过滤 用户兴趣 双重聚类 K-means优化 调和相似性计算 Collaborative ifltering User interest Double cluster K-means optimization Harmonic similarity calculation
  • 相关文献

参考文献5

  • 1FIDEL C.,V'CTOR C.,DIEGO F.& VREIXO O. Comparison of Collaborative Filtering Algorithms: Limitations of Current Techniques and Proposals forScalable, nigh-Performance Recommender Systems[J].ACM Transactions on the Web, 2011, 5 (1) : 2-33. 被引量:1
  • 2徐翔,王煦法.协同过滤算法中的相似度优化方法[J].计算机工程,2010,36(6):52-54. 被引量:37
  • 3Zhou T, Zoltan K, Liu J G. Solving the Apparent Diversity Accuracy Oilemma ot Kecommenoer ystemtJj.in rlu, of the National Academy of Sciences, 2010, 107(10): 4511-4517. 被引量:1
  • 4Fabrizio Sebastiani. Text categorization[M]. In Alessandro Zanasi(ed.), Text Mining and its Applications, UK: WIT Press, Southampton, 2005: 115-129. 被引量:1
  • 5沈西挺,董智佳.反映用户兴趣变化的协同过滤算法[J].计算机应用与软件,2013,30(6):295-297. 被引量:10

二级参考文献13

共引文献45

同被引文献15

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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