{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:02:42Z","timestamp":1746417762903,"version":"3.40.4"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319111155"},{"type":"electronic","value":"9783319111162"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11116-2_50","type":"book-chapter","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T21:04:18Z","timestamp":1408050258000},"page":"542-549","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Processing Node Proximity via Random Walk with Restart"],"prefix":"10.1007","author":[{"given":"Bingqing","family":"Lv","sequence":"first","affiliation":[]},{"given":"Weiren","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Liping","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Julie A.","family":"McCann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","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\u00a05, 442\u2013453 (2012)","journal-title":"PVLDB"},{"key":"50_CR2","unstructured":"Press, W.H.: Numerical recipes 3rd edition: The art of scientific computing. Cambridge university press (2007)"},{"issue":"4","key":"50_CR3","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik\u00a013(4), 354\u2013356 (1969)","journal-title":"Numerische Mathematik"},{"key":"50_CR4","first-page":"992","volume":"4","author":"Y. Sun","year":"2011","unstructured":"Sun, Y., Han, J., Yan, X., Yu, P.S., Wu, T.: PathSim: Meta path-based top-k similarity search in heterogeneous information networks. PVLDB\u00a04, 992\u20131003 (2011)","journal-title":"PVLDB"},{"key":"50_CR5","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"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-31235-9_15","volume-title":"Scientific and Statistical Database Management","author":"W. Yu","year":"2012","unstructured":"Yu, W., Le, J., Lin, X., Zhang, W.: On the efficiency of estimating penetrating rank on large graphs. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol.\u00a07338, pp. 231\u2013249. Springer, Heidelberg (2012)"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X.: IRWR: Incremental Random Walk with Restart. In: SIGIR, pp. 1017\u20131020 (2013)","DOI":"10.1145\/2484028.2484114"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W.: Towards efficient SimRank computation on large networks. In: ICDE, pp. 601\u2013612 (2013)","DOI":"10.1109\/ICDE.2013.6544859"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W.: Fast incremental SimRank on link-evolving graphs. In: ICDE, pp. 304\u2013315 (2014)","DOI":"10.1109\/ICDE.2014.6816660"},{"issue":"1","key":"50_CR10","first-page":"13","volume":"7","author":"W. Yu","year":"2013","unstructured":"Yu, W., Lin, X., Zhang, W., Chang, L., Pei, J.: More is simpler: Effectively and efficiently assessing node-pair similarities based on hyperlinks. PVLDB\u00a07(1), 13\u201324 (2013)","journal-title":"PVLDB"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W., Zhang, Y., Le, J.: SimFusion+: Extending simfusion towards efficient estimation on large and dynamic networks. In: SIGIR, pp. 365\u2013374 (2012)","DOI":"10.1145\/2348283.2348334"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11116-2_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T06:10:12Z","timestamp":1746339012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11116-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319111155","9783319111162"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11116-2_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}