计算机科学 ›› 2014, Vol. 41 ›› Issue (Z11): 320-322.

• 数据挖掘 • 上一篇    下一篇

结合用户判断力和相似性的协同推荐算法

张莉,薛羽青   

  1. 对外经济贸易大学信息学院 北京100029;对外经济贸易大学信息学院 北京100029
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家社科基金项目:社会网络中意见领袖对个性化信息推荐服务质量的影响研究(13BTQ027)资助

Collaborative Recommendation Algorithm Combining User’s Judging Power and Similarity

ZHANG Li and XUE Yu-qing   

  • Online:2018-11-14 Published:2018-11-14

摘要: 作为解决信息超载问题的有效方式,协同过滤技术已被成功地应用到推荐系统。为进一步提高协同过滤算法的性能,首先利用用户评分的历史信息,估计用户的判断力。接着结合用户间的相似性,提出一种改进的协同推荐算法。实验结果表明用户的判断力可与用户的推荐能力正相关,也验证了用户判断力深入抽取用户评分信息以及影响用户 采纳某项推荐结果的因素,以更好地刻画用户之间的相似性,从而提高算法的推荐准确度。

关键词: 协同过滤,用户判断力,相似性,推荐系统

Abstract: As an effective way to solve information overload,collaborative filtering(CF) technology has been successfully used in recommendation system.To improve the performance of CF algorithm,first,this paper evaluated user’s judging power based on historical scoring.Then combining user’s judging power and similarity,an improved collaborative recommendation algorithm was proposed.Experimental results show that judging power has positive correlation with recommendation abilities of users,which also verify that judging power extracts the depth information from historical scoring and factors influencing a user on adopting recommendation results.So it can characterize the similarity between users better and improve the accuracy of a recommendation algorithm.

Key words: Collaborative filtering,User’s judging power,Similarity,Recommendation system

[1] Su Xiao-yuan,Taghi M K.A Survey of Collaborative FilteringTechniques[J].Advances in Artificial Intelligence,2009(1):1-19
[2] Fidel C,V′ictor C,Diego F,et al.Comparison of Collaborative Filtering Algorithms:Limitations of Current Techniques and Proposals for Scalable,High-Performance Recommender Systems[J].ACM Transactions on the Web,2011,5(1):2-33
[3] 刘建国,周涛,汪秉宏.个性化推荐系统的研究进展[J].自然科学进展,2009,19(1):1-15
[4] Liu N N,Zhao Min,Xiang E,et al.Online evolutionary collaborative filtering[C]∥Proceedings of the fourth ACM Conference on Recommender systems.New York,2010:95-102
[5] 高滢,齐红,刘杰,等.结合似然关系模型和用户等级的协同过滤推荐算法[J].计算机研究与发展,2008,5(9):1463-1469
[6] 张迎峰,陈超,俞能海.基于最近邻用户动态重排序的协同过滤方法[J].小型微型计算机系统,2011,2(8):1581-1586
[7] Sun Tie-li,Wang Li-jun,Guoin Qing-he.A Collaborative Filtering Recommendation Algorithm Based on Item Similarity of User Preference[C]∥The 2th International Workshop on Knowledge Discovery and Data Mining.2009,1:60-63
[8] Yuan Q,Zhao S,Chen L,et al.Augmenting collaborative recommender by fusing explicit social relationships[C]∥Workshop on Recommender Systems and the Social Web.Recsys,2009:49-56
[9] De Meo P,Ferrara E,Fiumara G,et al.Improving recommendation quality by merging collaborative filtering and social relationships[C]∥2011 11th International Conference on Intelligent Systems Design and Applications(ISDA).2011:587-592
[10] Konstas I,Stathopoulos V,Jose J M.On social networks andcollaborative recommendation[C]∥Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval.ACM,2009:195-202
[11] Chen W,Fong S.Social network collaborative filtering framework and online trust factors:a case study on Facebook[C]∥2010 Fifth International Conference on Digital Information Management(ICDIM).2010:266-273
[12] Zheng R,Provost F,Ghose A.Social Network Collaborative Filtering:Preliminary Results[C]∥Proceedings of the Sixth Workshop on eBusiness(WEB2007).Montreal,2007:47-55
[13] Zhou T,Ren J,Medo M,et al.Bipartite network projection and personal recommendation[J].Physical Review E,2007,6(4):046115
[14] 杨兴耀,于炯,等.融合奇异性和扩散过程的协同过滤模型[J].软件学报,2013,24(8):1868-1884
[15] Bansal Harvir S,Voyer P A.Word-of-Mouth Processes within a Services Purchase Decision Context [J].Journal of Service Research,2000,3(2):166-177
[16] Yu Y K,Zhang Y C,Laureti P,et al.Decoding information from noisy,redundant,and intentionally distorted sources[J].Physica A:Statistical Mechanics and its Applications,2006,371(2):732-744

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!