{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T11:43:46Z","timestamp":1790423026615,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"MSIP","award":["2013005259"],"award-info":[{"award-number":["2013005259"]}]},{"name":"MSIP\/IITP","award":["10044970"],"award-info":[{"award-number":["10044970"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,27]]},"DOI":"10.1145\/2723372.2723716","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"1571-1585","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":64,"title":["BEAR"],"prefix":"10.1145","author":[{"given":"Kijung","family":"Shin","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinhong","family":"Jung","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sael","family":"Lee","sequence":"additional","affiliation":[{"name":"The State University of New York (SUNY) Korea, Incheon, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"U.","family":"Kang","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124330"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453903"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935914"},{"key":"e_1_3_2_1_7_1","first-page":"564","volume-title":"VLDB","author":"Balmin A.","year":"2004","unstructured":"A. Balmin , V. Hristidis , and Y. Papakonstantinou . Objectrank: Authority-based keyword search in databases . In VLDB , pages 564 -- 575 , 2004 . A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564--575, 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1201\/b17040"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505522"},{"key":"e_1_3_2_1_10_1","volume-title":"Convex Optimization","author":"Boyd S.","year":"2009","unstructured":"S. Boyd and L. Vandenberghe . Convex Optimization . Cambridge University Press , 2009 . S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2009."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014064"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0204-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_3_2_1_15_1","first-page":"12","article-title":"Random walks and electric networks","volume":"10","author":"Doyle P. G.","year":"1984","unstructured":"P. G. Doyle and J. L. Snell . Random walks and electric networks . AMC , 10 : 12 , 1984 . P. G. Doyle and J. L. Snell. Random walks and electric networks. AMC, 10:12, 1984.","journal-title":"AMC"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140441"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339538"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129128"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339628"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367738"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1027527.1027531"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.26"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2481244.2481249"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.71"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646196"},{"key":"e_1_3_2_1_27_1","volume-title":"Google';s PageRank and Beyond: The Science of Search Engine Rankings","author":"Langville A. N.","year":"2011","unstructured":"A. N. Langville and C. D. Meyer . Google';s PageRank and Beyond: The Science of Search Engine Rankings . Princeton University Press , 2011 . A. N. Langville and C. D. Meyer. Google';s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, 2011."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:7"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2320716"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646185"},{"key":"e_1_3_2_1_32_1","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","volume":"2","author":"Ng A. Y.","year":"2002","unstructured":"A. Y. Ng , M. I. Jordan , and Y. Weiss . On spectral clustering: Analysis and an algorithm . NIPS , 2 : 849 -- 856 , 2002 . A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. NIPS, 2:849--856, 2002.","journal-title":"NIPS"},{"key":"e_1_3_2_1_33_1","volume-title":"The pagerank citation ranking: Bringing order to the web. Technical report","author":"Page L.","year":"1999","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The pagerank citation ranking: Bringing order to the web. Technical report , Stanford University , 1999 . L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University, 1999."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014135"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/1032080"},{"key":"e_1_3_2_1_36_1","volume-title":"Numerical recipes","author":"Press W. H.","year":"2007","unstructured":"W. H. Press . Numerical recipes 3 rd edition: The art of scientific computing. Cambridge university press , 2007 . W. H. Press. Numerical recipes 3rd edition: The art of scientific computing. Cambridge university press, 2007.","edition":"3"},{"key":"e_1_3_2_1_37_1","first-page":"335","volume-title":"UAI","author":"Sarkar P.","year":"2007","unstructured":"P. Sarkar and A. W. Moore . A tractable approach to finding closest truncated-commute-time neighbors in large graphs . In UAI , pages 335 -- 343 , 2007 . P. Sarkar and A. W. Moore. A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In UAI, pages 335--343, 2007."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835871"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.103"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150448"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281271"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0094-2"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505535"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610500"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398450"},{"key":"e_1_3_2_1_46_1","first-page":"396","volume-title":"ICML","author":"Zhu Z. A.","year":"2013","unstructured":"Z. A. Zhu , S. Lattanzi , and V. Mirrokni . A local algorithm for finding well-connected clusters . In ICML , pages 396 -- 404 , 2013 . Z. A. Zhu, S. Lattanzi, and V. Mirrokni. A local algorithm for finding well-connected clusters. In ICML, pages 396--404, 2013."}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2723716","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2723372.2723716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:57Z","timestamp":1750273437000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2723716"}},"subtitle":["Block Elimination Approach for Random Walk with Restart on Large Graphs"],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":46,"alternative-id":["10.1145\/2723372.2723716","10.1145\/2723372"],"URL":"https:\/\/doi.org\/10.1145\/2723372.2723716","relation":{},"subject":[],"published":{"date-parts":[[2015,5,27]]},"assertion":[{"value":"2015-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}