Dawei Nie, Yan Fu, Junlin Zhou, Zhen Liu, Zi-Ke Zhang, Chuang Liu
{"title":"一种基于有偏随机漫步的个性化推荐算法","authors":"Dawei Nie, Yan Fu, Junlin Zhou, Zhen Liu, Zi-Ke Zhang, Chuang Liu","doi":"10.1109/JCSSE.2014.6841883","DOIUrl":null,"url":null,"abstract":"With the rapid development of Internet, Recommender Systems can help us efficiently find the useful objects in the information era. Generally, the traditional random walk algorithm has high accuracy but low personality and diversity. In this paper, we propose an improved random walk algorithm by depressing the influence of large-degree objects. Experimental results on MovieLens and Netflix data sets show that this algorithm can effectively improve not only the accuracy (improved by 5.5% and 5.9%, respectively) but also the diversity.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A personalized recommendation algorithm via biased random walk\",\"authors\":\"Dawei Nie, Yan Fu, Junlin Zhou, Zhen Liu, Zi-Ke Zhang, Chuang Liu\",\"doi\":\"10.1109/JCSSE.2014.6841883\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid development of Internet, Recommender Systems can help us efficiently find the useful objects in the information era. Generally, the traditional random walk algorithm has high accuracy but low personality and diversity. In this paper, we propose an improved random walk algorithm by depressing the influence of large-degree objects. Experimental results on MovieLens and Netflix data sets show that this algorithm can effectively improve not only the accuracy (improved by 5.5% and 5.9%, respectively) but also the diversity.\",\"PeriodicalId\":331610,\"journal\":{\"name\":\"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCSSE.2014.6841883\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2014.6841883","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A personalized recommendation algorithm via biased random walk
With the rapid development of Internet, Recommender Systems can help us efficiently find the useful objects in the information era. Generally, the traditional random walk algorithm has high accuracy but low personality and diversity. In this paper, we propose an improved random walk algorithm by depressing the influence of large-degree objects. Experimental results on MovieLens and Netflix data sets show that this algorithm can effectively improve not only the accuracy (improved by 5.5% and 5.9%, respectively) but also the diversity.