Abstract
Graph-based random walk models have recently become a popular approach to collaborative filtering recommendation systems. Under the conventional graph-based approach, a user node and item node are connected if the user has rated the item, and the value of the rating is represented as the weight of the connection. Commencing from some target user, a random walk is performed on the graph, and the results used to perform useful tasks such as ranking items in order of their importance to the user. Because random walk favors large-weighted connections, walk is more likely to proceed through two users that share a high rating for some item, than through users who share a low rating. This is a problem because there are similarity relations implicit in the data that are not being captured under this representation. We refer to this as the ‘High Ratings/Low Ratings’ problem. This paper proposes a novel graph representation scheme in which item ratings are represented using multiple nodes, allowing flow of information through both low-rating and high-rating connections. Empirical results on the MovieLens dataset show that recommendation rankings made using the proposed scheme are much better correlated with results in the test ratings, and that under a top-k evaluation, there is an improvement of up to 15 % in precision and recall. An attractive feature of the approach is that it also associates a confidence value with a recommendation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adomavicius, G., Tuzhilin, A.: Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng. 17(6), 734–749 (2005)
Bogers, T.: Movie recommendation using random walks over the contextual graph. In: Proceedings of the 2nd International Workshop on Context-Aware Recommender Systems (2010)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. ISDN Syst. 30(1), 107–117 (1998)
Fouss, F., Pirotte, A., Renders, J.M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19(3), 355–369 (2007)
Gabrielsson, S., Gabrielsson, S.: The Use of self-organizing maps in recommender systems. Master’s thesis, Department of Information Technology at the Division of Computer Systems, Uppsala University (2006)
Herlocker, J.L., Konstan, J.A.: Content-independent task-focused recommendation. IEEE Internet Comput. 5(6), 40–47 (2001)
Herlocker, J.L., Konstan, J.A., Terveen, L.G.: Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. (TOIS) 22(1), 5–53 (2004)
Jeh, G., Widom, J.: Scaling personalized web search. In: Proceedings of the 12th Wold Wide Web Conference (WWW), pp. 271–279 (2003)
Karypis, G.: Evaluation of item-based top-n recommendation algorithms. In: Proceedings of the Tenth International Conference on Information and Knowledge Management, pp. 247–254. ACM (2001)
Massa, P., Avesani, P.: Trust-aware recommender systems. In: Proceedings of the 2007 ACM Conference on Recommender Systems, pp. 17–24. ACM (2007)
Miller, B.N., Albert, I., Lam, S.K., Konstan, J.A., Riedl, J.: Movielens unplugged: Experiences with a recommender system on four mobile devices. In: Proceedings of the 2003 Conference on Intelligent User Interfaces (2003)
Mohsen, J., Ester, M.: TrustWalker: a random walk model for combining trust-based and item-based recommendation. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 397–406. ACM (2009)
Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)
Ricci, F., Rokach, L., Shapira, B., Kantor, P.: Recommender Systems Handbook. Springer, New York (2011)
Sarwar, B., Karypis, K., Konstan, J., Riedl, J.: Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th International Conference on World Wide Web, pp. 285–295. ACM (2001)
Shang, S., Kulkarni, S.R., Cuff, P.W., Hui, P.: A random walk based model incorporating social information for recommendation. International IEEE Workshop Machine Learning for Signal Processing, pp. 1–6 (2012)
Yildirim, H., Krishnamoorthy, M.S.: A random walk method for alleviating the sparsity problem in collaborative filtering. In: Proceedings of the 2008 ACM Conference on Recommender Systems, pp. 131–138. ACM (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Culha, A., Skabar, A. (2015). Graph-Based Collaborative Filtering Using Rating Nodes: A Solution to the High Ratings/Low Ratings Problem. In: Pfahringer, B., Renz, J. (eds) AI 2015: Advances in Artificial Intelligence. AI 2015. Lecture Notes in Computer Science(), vol 9457. Springer, Cham. https://doi.org/10.1007/978-3-319-26350-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-26350-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26349-6
Online ISBN: 978-3-319-26350-2
eBook Packages: Computer ScienceComputer Science (R0)