Research on Random Walk with Restart Recommendation Algorithm of Explicit Rating
Yu Yan1,2, Qiu Guanghua1,3
1. College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;
2. Computer Science Department, Southeast University Chenxian Colleage, Nanjing 210088, China;
3. Information Science Department, Pennsylvania State University, Malvern 19355, USA
Abstract：Aiming at random walk with restart recommendation algorithm mainly for implicit ratings while ignoring explicit ratings, this paper sets random walk under supervision to make recommendation, that makes the probabilities of items which user likes are greater than those of items which user dislikes. Experiment result demonstrates that this algorithm improves the accuracy of recommendation.
俞琰, 邱广华. 显式评分的重启动随机游走推荐算法研究[J]. 现代图书情报技术, 2012, 28(3): 8-14.
Yu Yan, Qiu Guanghua. Research on Random Walk with Restart Recommendation Algorithm of Explicit Rating. New Technology of Library and Information Service, 2012, 28(3): 8-14.
[1] Wang Z Q, Tan Y W, Zhang M. Graph-based Recommendation on Social Networks[C]. In: Proceedings of the 12th International Asia-Pacific Web Conference(APWEB), Busan. 2010:116-122.[2] Fouss F, Pirotte A, Renders J M,et al. Random-Walk Computation of Similarities Between Nodes of a Graph with Application to Collaborative Recommendation[J]. IEEE Transactions on Knowledge and Data Engineering, 2007, 19(3): 355-369.[3] Yen L, Saerens M, Mantrach A, et al. A Family of Dissimilarity Measures Between Nodes Generalizing both Shortest-path and the Commute-time Distances[C].In:Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD),New York. USA:ACM, 2008: 785-793.[4] Gori M, Pucci A. A Random-Walk Based Scoring Algorithm with Application to Recommender Systems for Large-Scale E-Commerce[C].In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia. USA:ACM, 2006:127-146.[5] Pan J Y, Yang H J, Faloutsos C, et al. Automatic Mulitmedia Cross-modal Correlation Discovery[C]. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle. USA: ACM, 2004:653-658.[6] Fouss F, Pirotte A, Saerens M. A Novel Way of Computing Similarities Between Nodes of a Graph, with Application to Collaborative Recommendation [C].In:Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence. USA: IEEE CPS, 2005: 550-556.[7] Das A, Datar M, Garg A,et al. Google News Personalization: Scalable Online Collaborative Filtering[C]. In:Proceedings of the 16th International Conference on World Wide Web,Canada.ACM, 2007: 272-280.[8] Linden G, Smith B, York J. Amazon.com Recommendation: Item-to-item Collaborative Filtering[J]. IEEE Internet Computing, 2003, 7(1): 76-80.[9] Su X Y, Khoshgoftaar T M. A Survey of Collaborative Filtering Techniques[J]. Advances in Artificial Intelligence, 2009:4.[10] Tong H, Faloutsos C, Pan J. Fast Random Walk with Restart and Its Applications[C].In: Proceedings of the 6th International Conference on Data Mining (ICDM ’06),Hong Kong. USA:IEEE CPS,2006: 613-622.[11] Pan J Y, Yang H J, Faloutsos C, et al. GCap: Graph-based Automatic Image Captioning [C].In: Proceedings of the Conference on Computer Vision and Pattern Recognition Workshop(CVPRW’04). USA:IEEE CPS, 2004: 146.[12] Urban J, Jose J M. Adaptive Image Retrieval Using a Graph Model for Semantic Feature Integration[C].In:Proceedings of the 8th ACM International Workshop on Multimedia Information Retrieval. USA: ACM, 2006: 117-126.[13] Fouss F, Pirotte A, Renders J M,et al. Random-Walk Computation of Similarities Between Nodes of a Graph with Application to Collaborative Recommendation[J]. Knowledge and Data Engineering, 2007, 19(3): 355-369.[14] Backstrom L, Leskovec J.Supervised Random Walks:Predicting and Recommending Links in Social Networks [C].In: Proceedings of the 4th ACM International Conference on Web Search and Data Mining. USA: ACM, 2011: 635-644.[15] Konstas I, Stahopoulos V, Jose J M. On Social Networks and Collaborative Recommendation[C].In:Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval,Boston. USA: ACM, 2009: 195-202.[16] Mobasher B, Dai H H, Luo T, et al. Discovery and Evaluation of Aggregate Usage Profiles for Web Personalization[J]. Data Mining and Knowledge Discovery, 2002, 6(1): 61-82.[17] Jin X, Zhou Y, Mobasher B.Web Usage Mining Based on Probabilistic Latent Semantic Analysis[C].In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. USA: ACM, 2004: 197-205.[18] Shao J, Yao L, Cai R Y, et al. Lasso–Based Tag Expansion and Tag–Boosted Collaborative Filtering[C]. In: Proceedings of the Advances in Multimedia Information Processing and the 11th Pacific Rim Conference on Multimedia: Part II. New York: Springer-Verlag,2011,6298: 559-570.[19] Jin R, Si L, Zhai C X, et al. Collaborative Filtering with Decoupled Models for Preferences and Ratings[C].In: Proceedings of the 12th International Conference on Information and Knowledge Management. USA: ACM, 2003: 309-316.[20] De K J, Liekens A, Goethals B. GauSo: Graph Base Music Recommendation in a Social Bookmarking Service[C]. In: Proceedings of the 10th International Symposium. New York: Spring-Verlag Inc, 2011:138-149.
