{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T13:42:36Z","timestamp":1789911756365,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339538","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"15-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":55,"title":["Efficient personalized pagerank with accuracy assurance"],"prefix":"10.1145","author":[{"given":"Yasuhiro","family":"Fujiwara","sequence":"first","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Makoto","family":"Nakatsuji","sequence":"additional","affiliation":[{"name":"NTT Service Evolution Laboratories, Kanagawa, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takeshi","family":"Yamamuro","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroaki","family":"Shiokawa","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Makoto","family":"Onizuka","sequence":"additional","affiliation":[{"name":"NTT Software Innovation Center, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390549"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2022148.2022153"},{"issue":"3","key":"e_1_3_2_2_4_1","first-page":"173","volume":"4","author":"Bahmani B.","year":"2010","unstructured":"B. Bahmani , A. Chowdhury , and A. Goel . Fast Incremental and Personalized PageRank. PVLDB , 4 ( 3 ): 173 -- 184 , 2010 . B. Bahmani, A. Chowdhury, and A. Goel. Fast Incremental and Personalized PageRank. PVLDB, 4(3):173--184, 2010.","journal-title":"Fast Incremental and Personalized PageRank. PVLDB"},{"key":"e_1_3_2_2_5_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_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0204-8"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031248"},{"key":"e_1_3_2_2_9_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Press , 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2009."},{"key":"e_1_3_2_2_10_1","volume-title":"Lower Bounds, and Experiments. Internet Mathematics, 2(3)","author":"Fogaras D.","year":"2005","unstructured":"D. Fogaras , B. R\u00e1cz , K. Csalog\u00e1ny , and T. Sarl\u00f3s . Towards Scaling Fully Personalized PageRank: Algorithms , Lower Bounds, and Experiments. Internet Mathematics, 2(3) , 2005 . D. Fogaras, B. R\u00e1cz, K. Csalog\u00e1ny, and T. Sarl\u00f3s. Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments. Internet Mathematics, 2(3), 2005."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140441"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401925"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020430"},{"key":"e_1_3_2_2_15_1","first-page":"2766","volume-title":"IJCAI","author":"Gori M.","year":"2007","unstructured":"M. Gori and A. Pucci . Itemrank: A Random-walk Based Scoring Algorithm for Recommender Engines . In IJCAI , pages 2766 -- 2771 , 2007 . M. Gori and A. Pucci. Itemrank: A Random-walk Based Scoring Algorithm for Recommender Engines. In IJCAI, pages 2766--2771, 2007."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1941933"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367738"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871509"},{"key":"e_1_3_2_2_19_1","volume-title":"Matrix Algebra From a Statistician's Perspective","author":"Harville D. A.","year":"2008","unstructured":"D. A. Harville . Matrix Algebra From a Statistician's Perspective . Springer , 2008 . D. A. Harville. Matrix Algebra From a Statistician's Perspective. Springer, 2008."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312682"},{"key":"e_1_3_2_2_21_1","volume-title":"WebDB","author":"Hristidis V.","year":"2011","unstructured":"V. Hristidis , L. Raschid , and Y. Wu . Scalable Link-based Personalization for Ranking in Entity-relationship Graphs . In WebDB , 2011 . V. Hristidis, L. Raschid, and Y. Wu. Scalable Link-based Personalization for Ranking in Entity-relationship Graphs. In WebDB, 2011."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871707"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060829"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020429"},{"key":"e_1_3_2_2_29_1","volume-title":"The Structure And Dynamics of Networks","author":"Newman M.","year":"2006","unstructured":"M. Newman , A.-L. Barabasi , and D. J. Watts . The Structure And Dynamics of Networks . Princeton University Press , 2006 . M. Newman, A.-L. Barabasi, and D. J. Watts. The Structure And Dynamics of Networks. Princeton University Press, 2006."},{"key":"e_1_3_2_2_31_1","volume-title":"Numerical Recipes","author":"Press W. H.","year":"2007","unstructured":"W. H. Press , S. A. Teukolsky , W. T. Vetterling , and B. P. Flannery . Numerical Recipes 3 rd Edition. Cambridge University Press , 2007 . W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes 3rd Edition. Cambridge University Press, 2007.","edition":"3"},{"key":"e_1_3_2_2_32_1","volume-title":"CLEF","author":"Smirnova E.","year":"2010","unstructured":"E. Smirnova , K. Avrachenkov , and B. Trousse . Using Web Graph Structure for Person Name Disambiguation . In CLEF , 2010 . E. Smirnova, K. Avrachenkov, and B. Trousse. Using Web Graph Structure for Person Name Disambiguation. In CLEF, 2010."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.103"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1186\/1752-0509-3-112"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956782"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935863"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/0602010"},{"key":"e_1_3_2_2_39_1","volume-title":"NIPS","author":"Zhou D.","year":"2003","unstructured":"D. Zhou , O. Bousquet , T. N. Lal , J. Weston , and B. Sch\u00f6lkopf . Learning with Local and Global Consistency . In NIPS , 2003 . D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Sch\u00f6lkopf. Learning with Local and Global Consistency. In NIPS, 2003."}],"event":{"name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Beijing China","acronym":"KDD '12","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339538","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:08Z","timestamp":1750238468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":38,"alternative-id":["10.1145\/2339530.2339538","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339538","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}