Computer Science ›› 2016, Vol. 43 ›› Issue (9): 111-115.doi: 10.11896/j.issn.1002-137X.2016.09.021

Previous Articles     Next Articles

Improved Friends Recommendation Algorithm Combining with User Rating Information

TANG Ying, ZHONG Nan-jiang and FAN Jing   

  • Online:2018-12-01 Published:2018-12-01

Abstract: Traditional friends recommendation algorithms only consider the topological similarity in calculating the similarity of friends.The similarity of users’ interests is seldomly taken into account,and the recommendation results are often not precise enough.Many existing social networking sites (such as Douban.com) provide the functions of user ratings,i.e. users can give ratings for certain types of items (such as movies).In order to calculate user’s interests similarity,we proposed a method which computes the interests similarity based on the ratings given by users and got more accurate result of recommendation by incorporating the interests similarity into the topological similarity.Firstly,we used cosine similarity to calculate the topological similarity between users.In calculating the interests similarity based on user ratings,we got the users cluster rating similarity matrix through the establishment of a probabilistic model,and derived users’ interests similarity from the rating similarity matrix.Finally,users’ interests similarity and topological similarity were combined to get the final improved friends recommendation algorithm.In order to verify the effectiveness of our method,we applied our method to the crawled user data from Douban website.The experimental results show that our method can effectively improve the accuracy of recommendation results compared with the traditional recom-mendation algorithm based on topology similarity.

Key words: Social network,Recommendation,Topology,Rating,Cluster,Similarity

[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!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!