{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T08:41:35Z","timestamp":1759826495716},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005275"},{"type":"electronic","value":"9783642005282"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00528-2_8","type":"book-chapter","created":{"date-parts":[[2009,2,16]],"date-time":"2009-02-16T04:31:32Z","timestamp":1234758692000},"page":"139-153","source":"Crossref","is-referenced-by-count":4,"title":["A Recommender System Based on Local Random Walks and Spectral Methods"],"prefix":"10.1007","author":[{"given":"Zeinab","family":"Abbassi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"http:\/\/www.blogpulse.com (visited, December 2006)"},{"key":"8_CR2","unstructured":"Parsons, J., Ralph, P., Gallagher, K.: Using viewing time to infer user preference in recommender systems. In: AAAI Workshop in Semantic Web Personalization, San Jose, California (July 2004)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/245108.245121","volume":"40","author":"P. Resnick","year":"1997","unstructured":"Resnick, P., Varian, H.: Recommender Systems. Communications of the ACM\u00a040, 56\u201358 (1997)","journal-title":"Communications of the ACM"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local Graph Partitioning using PageRank Vectors. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"8_CR5","unstructured":"Brin, S., Page, L., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web, Technical report, Stanford Digital Library Technologies Project (1998)"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR7","unstructured":"Verma, D., Meila, M.: A comparison of spectral clustering algorithms. Technical report UW-cse-03-05-01, University of Washington"},{"issue":"8","key":"8_CR8","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings- good, bad and spectral. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS 2000), pp. 367\u2013377 (2000)","DOI":"10.1109\/SFCS.2000.892125"},{"key":"8_CR10","unstructured":"Ng, A., Jordan, I., Weiss, Y.: On Spectral Clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems\u00a014, 849\u2013856"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating Collaborative Filtering Recommender Systems, ACM Transactions on Information Systems (TOIS) (2004)","DOI":"10.1145\/963770.963772"},{"key":"8_CR12","unstructured":"Lovasz, L.: Random walks on graphs: A survey (January 1993)"},{"key":"8_CR13","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. (2001)"},{"key":"8_CR14","first-page":"81","volume-title":"ACM STOC 2004","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: ACM STOC 2004, pp. 81\u201390. ACM Press, New York (2004)"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"T.H. Haveliwala","year":"2003","unstructured":"Haveliwala, T.H.: Topic-sensitive PageRank: A context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng.\u00a015(4), 784\u2013796 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Advances in Web Mining and Web Usage Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00528-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T21:50:46Z","timestamp":1558129846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00528-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005275","9783642005282"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00528-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}