{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,2]],"date-time":"2026-08-02T19:21:40Z","timestamp":1785698500377,"version":"3.56.0"},"reference-count":129,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSFC of China","award":["U2241212"],"award-info":[{"award-number":["U2241212"]}]},{"name":"NSFC of China","award":["61932001"],"award-info":[{"award-number":["61932001"]}]},{"name":"NSFC of China","award":["U2001212"],"award-info":[{"award-number":["U2001212"]}]},{"name":"NSFC of China","award":["U1936205"],"award-info":[{"award-number":["U1936205"]}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["4222028"],"award-info":[{"award-number":["4222028"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Outstanding Young Scientist Program","award":["BJJWZYJH012019100020098"],"award-info":[{"award-number":["BJJWZYJH012019100020098"]}]},{"name":"Hong Kong RGC GRF","award":["14217322"],"award-info":[{"award-number":["14217322"]}]},{"name":"Hong Kong RGC CRF","award":["C4158-20G"],"award-info":[{"award-number":["C4158-20G"]}]},{"name":"Hong Kong ITC ITF","award":["MRP\/071\/20X"],"award-info":[{"award-number":["MRP\/071\/20X"]}]},{"name":"CUHK Direct","award":["4055181"],"award-info":[{"award-number":["4055181"]}]},{"name":"Engineering Research Center of Next-Generation Intelligent Search and Recommendation, Ministry of Education"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1109\/tkde.2024.3376000","type":"journal-article","created":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:52:15Z","timestamp":1710269535000},"page":"4582-4602","source":"Crossref","is-referenced-by-count":44,"title":["Efficient Algorithms for Personalized PageRank Computation: A Survey"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7748-2138","authenticated-orcid":false,"given":"Mingji","family":"Yang","sequence":"first","affiliation":[{"name":"Renmin University of China, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0995-5546","authenticated-orcid":false,"given":"Hanzhi","family":"Wang","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3620-5086","authenticated-orcid":false,"given":"Zhewei","family":"Wei","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1892-6971","authenticated-orcid":false,"given":"Sibo","family":"Wang","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Sha Tin, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9777-9676","authenticated-orcid":false,"given":"Ji-Rong","family":"Wen","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196919"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/140976649"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2007.10129139"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319886"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1214-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-021-0482-x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-023-2768-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10878"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330860"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377376"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447713"},{"key":"ref18","article-title":"Predict then propagate: Graph neural networks meet personalized PageRank","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Klicpera"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"ref20","article-title":"Scalable graph neural networks via bidirectional propagation","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467243"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-015-4570-7"},{"key":"ref23","first-page":"22617","article-title":"Differentially private graph learning via sensitivity-bounded personalized PageRank","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Epasto"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511959"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3588930"},{"key":"ref26","first-page":"12","article-title":"The worlds largest matrix computation","author":"Moler","year":"2002","journal-title":"Matlab News Notes"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129098"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2014.2380315"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2952653"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/050643799"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1052934.1052938"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775191"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03536-9_5"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129091"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129104"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_12"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2008.10129302"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196920"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526140"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00105"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599251"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457298"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775190"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1013367.1013537"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2003.12.008"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1777432.1777434"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129128"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135823"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536348"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732978"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723716"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2901736"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035950"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939828"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129116"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242650"},{"key":"ref59","first-page":"2","article-title":"A sharp PageRank algorithm with applications to edge ranking and graph sparsification","volume-title":"Proc. 7th Int. Workshop Algorithms Models Web Graph","author":"Graham"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098072"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3360902"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00142"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2912606"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00576-7"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00084"},{"key":"ref66","first-page":"6459","article-title":"Improved communication cost in distributed PageRank computation - A theoretical study","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Luo"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461554"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482317"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3589305"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1145\/3588705"},{"key":"ref71","first-page":"5630","article-title":"Open problem: Running time complexity of accelerated $\\ell _{1}$\u21131-regularized PageRank","volume-title":"Proc. Annu. Conf. Learn. Theory","author":"Fountoulakis"},{"key":"ref72","first-page":"2852","article-title":"Accelerated and sparse algorithms for approximate personalized PageRank and beyond","volume-title":"Proc. Annu. Conf. Learn. Theory","author":"Mart\u00ednez-Rubio"},{"key":"ref73","article-title":"Personalized PageRank to a target node","author":"Lofgren","year":"2013"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403108"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339538"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556554"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623745"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835823"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26784-5_13"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021936"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00073"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1137\/19M1266976"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031248"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458122"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2487878"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.14778\/3611479.3611500"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140441"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463717"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8454"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610500"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367738"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0204-8"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497599"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21286-4_5"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150419"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063670"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30541-2_4"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.802752"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732276"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835871"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.14778\/1929861.1929864"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939804"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339539"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484114"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0070"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783297"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186107"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3175814"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2003.1210016"},{"key":"ref110","first-page":"179","article-title":"Distributed page ranking in structured P2P networks","volume-title":"Proc. 32nd Int. Conf. Parallel Process.","author":"Shi"},{"key":"ref111","first-page":"420","article-title":"Computing PageRank in a distributed internet search engine system","volume-title":"Proc. 30th Int. Conf. Very Large Data Bases","author":"Wang"},{"key":"ref112","first-page":"415","article-title":"Efficient and decentralized PageRank approximation in a peer-to-peer web search network","volume-title":"Proc. 32nd Int. Conf. Very Large Data Bases","author":"Parreira"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099705"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989425"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.14778\/2757807.2757812"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983713"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035920"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.14778\/3151113.3151121"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.14778\/3357377.3357379"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313555"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.04.003"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014496"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384303"},{"key":"ref124","first-page":"21 375","article-title":"Efficient and local parallel random walks","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Kapralov"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783278"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523216"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376928"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970397"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.120"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10629652\/10471277.pdf?arnumber=10471277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T05:49:11Z","timestamp":1723182551000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10471277\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":129,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3376000","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9]]}}}