{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:50:42Z","timestamp":1725497442069},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540774846"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77485-3_8","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T15:36:28Z","timestamp":1196955388000},"page":"127-146","source":"Crossref","is-referenced-by-count":5,"title":["A Random-Walk Based Scoring Algorithm Applied to Recommender Engines"],"prefix":"10.1007","author":[{"given":"Augusto","family":"Pucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Gori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Maggini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Artificial Intelligence","first-page":"26","volume-title":"Machine Learning: ECML 2004","author":"F. Fouss","year":"2004","unstructured":"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.\u00a03201, pp. 26\u201337. Springer, Heidelberg (2004)"},{"key":"8_CR2","unstructured":"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)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/371920.372071"},{"key":"8_CR4","volume-title":"From Usenet to CoWebs: Interacting with Social Information Spaces","author":"B. Miller","year":"2002","unstructured":"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)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Shardanand, U., Maes, P.: Social information filtering: Algorithms for automating \u201dword of mouth\u201d. In: CHI 1995 (1995)","DOI":"10.1145\/223904.223931"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1011419012209","volume":"4","author":"K. Goldberg","year":"2001","unstructured":"Goldberg, K., Roeder, T., Gupta, D., Perkins, C.: Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval\u00a04(2), 133\u2013151 (2001)","journal-title":"Information Retrieval"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Schafer, J., Konstan, J., Riedl, J.: Electronic commerce recommender applications. Journal of Data Mining and Knowledge Discovery (January 2001)","DOI":"10.1007\/978-1-4615-1627-9_6"},{"key":"8_CR8","first-page":"550","volume-title":"IEEE \/ WIC \/ ACM International Joint Conference on Web Intelligence","author":"F. Fouss","year":"2005","unstructured":"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\u2013556. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"8_CR9","volume-title":"ACM WebKDD 2000 Web Mining for E-Commerce Workshop","author":"B.M. Sarwar","year":"2000","unstructured":"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)"},{"key":"8_CR10","unstructured":"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\u201352 (July 1998)"},{"key":"8_CR11","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Advances in Web Mining and Web Usage Analysis","author":"M. Grcar","year":"2006","unstructured":"Grcar, M., Fortuna, B., Mladenic, D., Grobelnik, M.: Knn versus svm in the collaborative filtering framework. In: Nasraoui, O., Za\u00efane, O., Spiliopoulou, M., Mobasher, B., Masand, B., Yu, P.S. (eds.) WebKDD 2005. LNCS (LNAI), vol.\u00a04198, Springer, Heidelberg (2006)"},{"key":"8_CR12","volume-title":"IEEE Conference on Security and Privacy","author":"J. Canny","year":"2002","unstructured":"Canny, J.: Collaborative filtering with privacy via factor analysis. In: IEEE Conference on Security and Privacy, IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"8_CR13","volume-title":"ACM SIGIR 1999","author":"J. Herlocker","year":"1999","unstructured":"Herlocker, J., Konstan, J., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: ACM SIGIR 1999, ACM Press, ACM SIGIR (1999)"},{"key":"8_CR14","volume-title":"Finite Markov Chains","author":"J.G. Kemeny","year":"1976","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)"},{"key":"8_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810633","volume-title":"Markov Chains","author":"J. Norris","year":"1997","unstructured":"Norris, J.: Markov Chains. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L. Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychmetrika\u00a018(1), 39\u201343 (1953)","journal-title":"Psychmetrika"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/963770.963775","volume":"22","author":"Z. Huang","year":"2004","unstructured":"Huang, Z., Chen, H., Zeng, D.: Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Transactions on Information Systems\u00a022(1), 116\u2013142 (2004)","journal-title":"ACM Transactions on Information Systems"},{"key":"8_CR18","volume-title":"Learning with kernels","author":"B. Scholkopf","year":"2002","unstructured":"Scholkopf, B., Smola, A.: Learning with kernels. MIT Press, Cambridge (2002)"},{"issue":"9","key":"8_CR19","first-page":"1505","volume":"58","author":"P. Chebotarev","year":"1997","unstructured":"Chebotarev, P., Shamis, E.: The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control\u00a058(9), 1505\u20131514 (1997)","journal-title":"Automation and Remote Control"},{"issue":"10","key":"8_CR20","first-page":"1443","volume":"59","author":"P. Chebotarev","year":"1998","unstructured":"Chebotarev, P., Shamis, E.: On proximity measures for graph vertices. Automation and Remote Control\u00a059(10), 1443\u20131459 (1998)","journal-title":"Automation and Remote Control"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Harel, D., Koren, Y.: On clustering using random walks. In: Conference on the Foundations of Software Technology and Theoretical Computer Science, pp. 18\u201341 (2001)","DOI":"10.1007\/3-540-45294-X_3"},{"key":"8_CR22","first-page":"227","volume-title":"Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data mining","author":"S. White","year":"2003","unstructured":"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\u2013266. ACM Press, New York (2003)"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"M. Newman","year":"2005","unstructured":"Newman, M.: A measure of betweenness centrality based on random walks. Social Networks\u00a027(1), 39\u201354 (2005)","journal-title":"Social Networks"},{"key":"8_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"key":"8_CR25","unstructured":"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)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Brand, M.: A random walks perspective on maximizing satisfaction and profit. In: 2005 SIAM International Conference on Data Mining (2005)","DOI":"10.1137\/1.9781611972757.2"},{"key":"8_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_51","volume-title":"Machine Learning: ECML 2005","author":"C. Ding","year":"2005","unstructured":"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.\u00a03720, Springer, Heidelberg (2005)"},{"key":"8_CR28","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Machine Learning: ECML 2004","author":"M. Saerens","year":"2004","unstructured":"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.\u00a03201, Springer, Heidelberg (2004)"},{"key":"8_CR29","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University (1998)"},{"key":"8_CR30","unstructured":"Haveliwala, T.: Efficient computation of pagerank. Technical report, Stanford University (1999)"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Extrapolation methods for accelerating pagerank computations. In: Twelfth International Conference on World Wide Web (2003)","DOI":"10.1145\/775152.775190"},{"key":"8_CR32","unstructured":"Golub, G., Loan, C.V.: Matrix Computations, 3rd edn., The Johns Hopkins University Press (1996)"},{"issue":"3","key":"8_CR33","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A. Langville","year":"2003","unstructured":"Langville, A., Meyer, C.: Deeper inside pagerank. Internet Mathematics\u00a01(3), 335\u2013380 (2003)","journal-title":"Internet Mathematics"},{"issue":"1","key":"8_CR34","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/1052934.1052938","volume":"5","author":"M. Bianchini","year":"2005","unstructured":"Bianchini, M., Gori, M., Scarselli, F.: Inside pagerank. ACM Transactions on Internet Technology\u00a05(1), 92\u2013128 (2005)","journal-title":"ACM Transactions on Internet Technology"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.: Topic-sensitive pagerank. In: Eleventh International Conference on World Wide Web (2002)","DOI":"10.1145\/511446.511513"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/775152.775242"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Gyongyi, Z., Garcia-Molina, H., Pedersen, J.: Combating web spam with trustrank. Technical report, Stanford University (2004)","DOI":"10.1016\/B978-012088469-8.50052-8"},{"issue":"8","key":"8_CR38","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.aml.2004.07.034","volume":"18","author":"N. Ho","year":"2005","unstructured":"Ho, N., Dooren, P.V.: On the pseudo-inverse of the laplacian of a bipartite graph. Applied Mathematics Letters\u00a018(8), 917\u2013922 (2005)","journal-title":"Applied Mathematics Letters"},{"key":"8_CR39","volume-title":"Nonparametric Statistics for the Behavioral Sciences","author":"S. Siegel","year":"1988","unstructured":"Siegel, S., Castellan, J.: Nonparametric Statistics for the Behavioral Sciences. McGraw-Hill, New York (1988)"}],"container-title":["Lecture Notes in Computer Science","Advances in Web Mining and Web Usage Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77485-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:30Z","timestamp":1619522070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77485-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540774846"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77485-3_8","relation":{},"subject":[]}}