计算机科学 ›› 2016, Vol. 43 ›› Issue (9): 111-115.doi: 10.11896/j.issn.1002-137X.2016.09.021
• 2015 年第三届CCF 大数据学术会议 • 上一篇 下一篇
汤颖,钟南江,范菁
TANG Ying, ZHONG Nan-jiang and FAN Jing
摘要: 传统的好友推荐算法在计算好友相似度时通常仅仅考虑用户在社交网络的拓扑结构的相似性,而对用户的兴趣相似性考虑较少,因此推荐的结果往往不够精准。现有的很多社交网站(如豆瓣网)提供了用户评分功能,用户可以对某类物品(如电影)给出自己的评分。为了在推荐时计算用户的兴趣相似度,提出基于用户给出的对某类物品的评分来计算用户的兴趣相似度,从而在拓扑相似度的基础上结合兴趣相似度得到更精准的推荐结果。首先使用余弦相似度计算出用户间拓扑相似度;其次在计算基于评分的用户兴趣相似度时,通过建立概率模型得到用户聚类评分相似度矩阵,从该评分矩阵推导出用户间基于评分的兴趣相似度;最后,结合拓扑相似度和评分相似度得到最终的改进好友推荐算法,计算出相似度值最高的N个人推荐给当前用户。为了验证所提方法的有效性,用提出的方法对豆瓣网抓取的用户数据进行好友推荐,实验结果证明所提方法与传统的基于拓扑的好友推荐算法相比可以有效提高好友推荐的准确性。
[1] Gou L,You F,Guo J,et al.Sfviz:interest-based friends explora-tion and recommendation in social networks[C]∥Proceedings of the 2011 Visual Information Communication-International Symposium.ACM,2011:1-10 [2] Han X,Wang L,Crespi N,et al.Alike people,alike interests?Inferring interest similarity in online social networks[J].Decision Support Systems,2015,69(1):92-106 [3] Krulwich B.Lifestyle finder:intelligent user profiling usinglarge-scale demographic data[J].Artificial Intelligence Magazine,1997,18(2):37-45 [4] Pazzani M,Billsus D.Learning and revising user profiles:the identification of interesting web sites[J].Machine Learning,1997,27(3):313-331 [5] Dahlen B J,Konstan J A,Herlocker J L,et al.Jump-starting movielens:User benefits of starting a collaborative filtering system with dead data[D].University of Minnesota TR,1998 [6] Linden G,Smith B,York J.Amazon.com Recommendations:Item-to-Item Collaborative Filtering[J].IEEE Internet Computing,2003,7(1):76-80 [7] Hofmann T.Latent semantic models for collaborative filtering[J].ACM Transactions on Information Systems,2004,22(1):89-115 [8] Yang X,Guo Y,Liu Y.Bayesian-Inference-Based Recommendation in Online Social Networks [J].IEEE Transactions on Pa-rallel and Distributed Systems,2013,24(4):642-651 [9] Hofmann T.Probabilistic latent semantic analysis[C]∥UAI’99.Morgan Kaufmann,1999:289-296 [10] Ye M,Liu X,Lee W C.Exploring social influence for recommendation:a generative model approach[C]∥Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval.ACM,2012:671-680 [11] Tan P,Steinbach M,Kumar V,et al.Introduction to data mining[M].Pearson Addison Wesley Boston,2006 [12] Salton G,McGill M.Introduction to Modern Information Re-trieval[M].McGraw Hill,New York,USA,1983 [13] Adamic L,Adar E.Friends and neighbors on the Web[J].Social Networks,2003,25(3):211-230 [14] McPherson M,Smith-Lovin L,et al.Birds of a Feather:Ho-mophily in Social Networks[J].Annual Review of Sociology,2001,27(1):415-444 [15] Si L,Jin R.Flexible mixture model for collaborative filtering[C]∥ICML.2003,3:704-711 [16] Barabasi A,Albert R.Emergence of scaling in random networks[J].Science,1999,286(5439):509-512 [17] Zhou T,Lu L,Zhang Y C.Predicting missing links via local information[J].European Physical Journal B,2009,71(4):623-630 [18] Katz L.A new status index derived from sociometric analysis[J].Psychometrika,1953,18(1):39-43 [19] Jeh G,Widom J.SimRank:A measure of structural-context similarity[C]∥Proc.of SIGKDD’02.2002:538-543 [20] Leicht E,Holme P,Newman M.Vertex similarity in networks[J].Physical Review E,2006,73(2):26120 [21] Zhao P,Han J,Sun Y.P-Rank:a comprehensive structural similarity measure over information networks[C]∥Proc.of CIKM’09.2009:553-562 [22] Gou L,Chen H,Kim J,et al Social Network Document Ranking[C]∥Proc.of JCDL’10.2010:313-322 [23] Gou L,Chen H,Kim J,et al..SNDocRank:a Social Network-Based Video Search Ranking Framework[C]∥Proc.of ACM MIR’10.2010:367-376 [24] Li C,Han J,He G,et al.Fast computation of simrank for static and dynamic information networks[C]∥Proc.of EDBT’10.2010:465-476 [25] Zeng W,Zeng A,Liu H,et al.Uncovering the information core in recommender systems[J].Scientific Reports,2014,4:6140 |
No related articles found! |
|