Abstract
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by extracting knowledge from the previous users’ interactions. In this paper, we present “ItemRank”, a random–walk based scoring algorithm, which can be used to rank products according to expected user preferences, in order to recommend top–rank items to potentially interested users. We tested our algorithm on a standard database, the MovieLens data set, which contains data collected from a popular recommender system on movies and that has been widely exploited as a benchmark for evaluating recently proposed approaches to recommender systems (e.g. [1,2]). We compared ItemRank with other state-of-the-art ranking techniques on this task. Our experiments show that ItemRank performs better than the other algorithms we compared to and, at the same time, it is less complex with respect to memory usage and computational cost too. The presentation of the method is accompanied by an analysis of the MovieLens data set main properties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fouss, F., Pirotte, A., Sarens, M.: A novel way of computing dissimilarities between nodes of a graph, with application to collaborative filtering. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 26–37. Springer, Heidelberg (2004)
Sarwar, B.M., Karypis, G., Konstan, J., Riedl, J.: Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering. In: Fifth International Conference on Computer and Information Technology (2002)
Sarwar, B.M., Karypis, G., Konstan, J.A., Riedl, J.: Item-based collaborative filtering recommendation algorithms. In (WWW10). 10th International World Wide Web Conference (May 2001)
Miller, B., Riedl, J., Konstan, J.: Grouplens for usenet: Experiences in applying collaborative filtering to a social information system. In: Leug, C., Fisher, D. (eds.) From Usenet to CoWebs: Interacting with Social Information Spaces, Springer, Heidelberg (2002)
Shardanand, U., Maes, P.: Social information filtering: Algorithms for automating ”word of mouth”. In: CHI 1995 (1995)
Goldberg, K., Roeder, T., Gupta, D., Perkins, C.: Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval 4(2), 133–151 (2001)
Schafer, J., Konstan, J., Riedl, J.: Electronic commerce recommender applications. Journal of Data Mining and Knowledge Discovery (January 2001)
Fouss, F., Pirotte, A., Renders, J.M., Sarens, M.: A novel way of computing dissimilarities between nodes of a graph, with application to collaborative filtering. In: IEEE / WIC / ACM International Joint Conference on Web Intelligence, pp. 550–556. IEEE Computer Society Press, Los Alamitos (2005)
Sarwar, B.M., Karypis, G., Konstan, J.A., Riedl, J.: Application of dimensionality reduction in recommender system a case study. In: ACM WebKDD 2000 Web Mining for E-Commerce Workshop, ACM Press, New York (2000)
Breese, J.S., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering. In: 14th Conference on Uncertainty in Artificial Intelligence (UAI-98), pp. 43–52 (July 1998)
Grcar, M., Fortuna, B., Mladenic, D., Grobelnik, M.: Knn versus svm in the collaborative filtering framework. In: Nasraoui, O., Zaïane, O., Spiliopoulou, M., Mobasher, B., Masand, B., Yu, P.S. (eds.) WebKDD 2005. LNCS (LNAI), vol. 4198, Springer, Heidelberg (2006)
Canny, J.: Collaborative filtering with privacy via factor analysis. In: IEEE Conference on Security and Privacy, IEEE Computer Society Press, Los Alamitos (2002)
Herlocker, J., Konstan, J., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: ACM SIGIR 1999, ACM Press, ACM SIGIR (1999)
Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)
Norris, J.: Markov Chains. Cambridge University Press, Cambridge (1997)
Katz, L.: A new status index derived from sociometric analysis. Psychmetrika 18(1), 39–43 (1953)
Huang, Z., Chen, H., Zeng, D.: Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Transactions on Information Systems 22(1), 116–142 (2004)
Scholkopf, B., Smola, A.: Learning with kernels. MIT Press, Cambridge (2002)
Chebotarev, P., Shamis, E.: The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control 58(9), 1505–1514 (1997)
Chebotarev, P., Shamis, E.: On proximity measures for graph vertices. Automation and Remote Control 59(10), 1443–1459 (1998)
Harel, D., Koren, Y.: On clustering using random walks. In: Conference on the Foundations of Software Technology and Theoretical Computer Science, pp. 18–41 (2001)
White, S., Smyth, P.: Algorithms for estimating relative importance in networks. In: Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pp. 227–266. ACM Press, New York (2003)
Newman, M.: A measure of betweenness centrality based on random walks. Social Networks 27(1), 39–54 (2005)
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)
Nadler, B., Lafon, S., Coifman, R., Kevrekidis, I.: Diffusion maps, spectral clustering and eigenfunctions of fokker-planck operators. In: Advances in Neural Information Processing Systems (2005)
Brand, M.: A random walks perspective on maximizing satisfaction and profit. In: 2005 SIAM International Conference on Data Mining (2005)
Ding, C.: Tutorial on spectral clustering. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, Springer, Heidelberg (2005)
Saerens, M., Fouss, F., Yen, L., Dupont, P.: The principal components analysis of a graph, and its relationships to spectral clustering. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, Springer, Heidelberg (2004)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University (1998)
Haveliwala, T.: Efficient computation of pagerank. Technical report, Stanford University (1999)
Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Extrapolation methods for accelerating pagerank computations. In: Twelfth International Conference on World Wide Web (2003)
Golub, G., Loan, C.V.: Matrix Computations, 3rd edn., The Johns Hopkins University Press (1996)
Langville, A., Meyer, C.: Deeper inside pagerank. Internet Mathematics 1(3), 335–380 (2003)
Bianchini, M., Gori, M., Scarselli, F.: Inside pagerank. ACM Transactions on Internet Technology 5(1), 92–128 (2005)
Haveliwala, T.: Topic-sensitive pagerank. In: Eleventh International Conference on World Wide Web (2002)
Kamvar, S., Schlosser, M., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: Twelfth International Conference on World Wide Web (2003)
Gyongyi, Z., Garcia-Molina, H., Pedersen, J.: Combating web spam with trustrank. Technical report, Stanford University (2004)
Ho, N., Dooren, P.V.: On the pseudo-inverse of the laplacian of a bipartite graph. Applied Mathematics Letters 18(8), 917–922 (2005)
Siegel, S., Castellan, J.: Nonparametric Statistics for the Behavioral Sciences. McGraw-Hill, New York (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pucci, A., Gori, M., Maggini, M. (2007). A Random-Walk Based Scoring Algorithm Applied to Recommender Engines. In: Nasraoui, O., Spiliopoulou, M., Srivastava, J., Mobasher, B., Masand, B. (eds) Advances in Web Mining and Web Usage Analysis. WebKDD 2006. Lecture Notes in Computer Science(), vol 4811. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77485-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-77485-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77484-6
Online ISBN: 978-3-540-77485-3
eBook Packages: Computer ScienceComputer Science (R0)