{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:50Z","timestamp":1763468270100,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319235240"},{"type":"electronic","value":"9783319235257"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23525-7_37","type":"book-chapter","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T08:20:13Z","timestamp":1440750013000},"page":"608-624","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Fast Inbound Top-K Query for Random Walk with Restart"],"prefix":"10.1007","author":[{"given":"Chao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Shan","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Yucheng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yidan","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-77004-6_12","volume-title":"Algorithms and Models for the Web-Graph","author":"R Andersen","year":"2007","unstructured":"Andersen, R., Borgs, C., Chayes, J.T., Hopcraft, J., Mirrokni, V.S., Teng, S.-H.: Local computation of pagerank contributions. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 150\u2013165. Springer, Heidelberg (2007)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-21286-4_5","volume-title":"Algorithms and Models for the Web Graph","author":"K Avrachenkov","year":"2011","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., Smirnova, E., Sokol, M.: Quick detection of top-k personalized pagerank lists. In: Frieze, A., Horn, P., Pra\u0142at, P. (eds.) WAW 2011. LNCS, vol. 6732, pp. 50\u201361. Springer, Heidelberg (2011)"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Chakrabarti, K., Xin, D.: Fast personalized pagerank on mapreduce. In: SIGMOD Conference, pp. 973\u2013984 (2011)","DOI":"10.1145\/1989323.1989425"},{"issue":"3","key":"37_CR5","first-page":"173","volume":"4","author":"B Bahmani","year":"2010","unstructured":"Bahmani, B., Chowdhury, A., Goel, A.: Fast incremental and personalized pagerank. PVLDB 4(3), 173\u2013184 (2010)","journal-title":"PVLDB"},{"issue":"3","key":"37_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D Fogaras","year":"2005","unstructured":"Fogaras, D., R\u00e1cz, B., Csalog\u00e1ny, K., Sarl\u00f3s, T.: Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics 2(3), 333\u2013358 (2005)","journal-title":"Internet Mathematics"},{"issue":"5","key":"37_CR7","first-page":"442","volume":"5","author":"Y Fujiwara","year":"2012","unstructured":"Fujiwara, Y., Nakatsuji, M., Onizuka, M., Kitsuregawa, M.: Fast and exact top-k search for random walk with restart. PVLDB 5(5), 442\u2013453 (2012)","journal-title":"PVLDB"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Mishima, T., Onizuka, M.: Efficient ad-hoc search for personalized pagerank. In: SIGMOD Conference, pp. 445\u2013456 (2013)","DOI":"10.1145\/2463676.2463717"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Yamamuro, T., Shiokawa, H., Onizuka, M.: Efficient personalized pagerank with accuracy assurance. In: KDD, pp. 15\u201323 (2012)","DOI":"10.1145\/2339530.2339538"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Gupta, M.S., Pathak, A., Chakrabarti, S.: Fast algorithms for topk personalized pagerank queries. In: WWW, pp. 1225\u20131226 (2008)","DOI":"10.1145\/1367497.1367738"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW, pp. 271\u2013279 (2003)","DOI":"10.1145\/775152.775191"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Konstas, I., Stathopoulos, V., Jose, J.M.: On social networks and collaborative recommendation. In: SIGIR, pp. 195\u2013202 (2009)","DOI":"10.1145\/1571941.1571977"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J.M.: The link prediction problem for social networks. In: CIKM, pp. 556\u2013559 (2003)","DOI":"10.1145\/956863.956972"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Lofgren, P., Banerjee, S., Goel, A., Comandur, S.: FAST-PPR: scaling personalized pagerank estimation for large graphs. In: KDD, pp. 1436\u20131445 (2014)","DOI":"10.1145\/2623330.2623745"},{"key":"37_CR15","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University (1998)"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Pan, J.Y.: Fast random walk with restart and its applications. In: ICDM, pp. 613\u2013622 (2006)","DOI":"10.1109\/ICDM.2006.70"},{"issue":"5","key":"37_CR17","first-page":"401","volume":"7","author":"AW Yu","year":"2014","unstructured":"Yu, A.W., Mamoulis, N., Su, H.: Reverse top-k search using random walk with restart. PVLDB 7(5), 401\u2013412 (2014)","journal-title":"PVLDB"},{"issue":"6","key":"37_CR18","first-page":"481","volume":"6","author":"F Zhu","year":"2013","unstructured":"Zhu, F., Fang, Y., Chang, K.C.C., Ying, J.: Incremental and accuracy-aware personalized pagerank through scheduled approximation. PVLDB 6(6), 481\u2013492 (2013)","journal-title":"PVLDB"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23525-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T00:09:58Z","timestamp":1599437398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23525-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319235240","9783319235257"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23525-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}