A random-walk based scoring algorithm applied to recommender engines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4811 LNAI, Issue , 2007, Pages 127-146

  Pucci, A ^a   Gori, M ^a   Maggini, M ^a  

^a UNIVERSITY OF SIENA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; DATA STRUCTURES; DATABASE SYSTEMS; RANDOM PROCESSES;

COMPUTATIONAL COST; MEMORY USAGE; RANDOM WALK; RECOMMENDER SYSTEMS;

SEARCH ENGINES;

EID: 38549083586     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77485-3_8     Document Type: Conference Paper

References (39)

1. 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)
2. Sarwar, B.M., Karypis, G., Konstan, J., Riedl, J.: Recommender systems for largescale e-commerce: Scalable neighborhood formation using clustering. In: Fifth International Conference on Computer and Information Technology (2002)
3. 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)
4. 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)
5. Shardanand, U., Maes, P.: Social information filtering: Algorithms for automating "word of mouth". In: CHI 1995 (1995)
6. Goldberg, K., Roeder, T., Gupta, D., Perkins, C.: Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval 4(2), 133-151 (2001)
7. Schafer, J., Konstan, J., Riedl, J.: Electronic commerce recommender applications. Journal of Data Mining and Knowledge Discovery (January 2001)
8. 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)
9. 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)
10. 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)
11. 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)
12. Canny, J.: Collaborative filtering with privacy via factor analysis. In: IEEE Conference on Security and Privacy, IEEE Computer Society Press, Los Alamitos (2002)
13. Herlocker, J., Konstan, J., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: ACM SIGIR 1999, ACM Press, ACM SIGIR (1999)
14. Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)
15. Norris, J.: Markov Chains. Cambridge University Press, Cambridge (1997)
16. Katz, L.: A new status index derived from sociometric analysis. Psychmetrika 18(1), 39-43 (1953)
17. 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)
18. Scholkopf, B., Smola, A.: Learning with kernels. MIT Press, Cambridge (2002)
19. Chebotarev, P., Shamis, E.: The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control 58(9), 1505-1514 (1997)
20. Chebotarev, P., Shamis, E.: On proximity measures for graph vertices. Automation and Remote Control 59(10), 1443-1459 (1998)
21. 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)
22. 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)
23. Newman, M.: A measure of betweenness centrality based on random walks. Social Networks 27(1), 39-54 (2005)
24. Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)
25. 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)
26. Brand, M.: A random walks perspective on maximizing satisfaction and profit. In: 2005 SIAM International Conference on Data Mining (2005)
27. 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)
28. 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)
29. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University (1998)
30. Haveliwala, T.: Efficient computation of pagerank. Technical report, Stanford University (1999)
31. Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Extrapolation methods for accelerating pagerank computations. In: Twelfth International Conference on World Wide Web (2003)
32. Golub, C., Loan, C.V.: Matrix Computations, 3rd edn., The Johns Hopkins University Press (1996)
33. Langville, A., Meyer, C.: Deeper inside pagerank. Internet Mathematics 1(3), 335-380 (2003)
34. Bianchini, M., Gori, M., Scarselli, F.: Inside pagerank. ACM Transactions on Internet Technology 5(1), 92-128 (2005)
35. Haveliwala, T.: Topic-sensitive pagerank. In: Eleventh International Conference on World Wide Web (2002)
36. 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)
37. Gyongyi, Z., Garcia-Molina, H., Pedersen, J.: Combating web spam with trustrank. Technical report, Stanford University (2004)
38. Ho, N., Dooren, P. V.: On the pseudo-inverse of the laplacian of a bipartite graph. Applied Mathematics Letters 18(8), 917-922 (2005)
39. Siegel, S., Castellan, J.: Nonparametric Statistics for the Behavioral Sciences. McGraw-Hill, New York (1988)