{"id":"https://openalex.org/W2914628078","doi":"https://doi.org/10.1145/3308558.3313555","title":"Distributed Algorithms for Fully Personalized PageRank on Large Graphs","display_name":"Distributed Algorithms for Fully Personalized PageRank on Large Graphs","publication_year":2019,"publication_date":"2019-05-13","ids":{"openalex":"https://openalex.org/W2914628078","doi":"https://doi.org/10.1145/3308558.3313555","mag":"2914628078"},"language":"en","primary_location":{"id":"doi:10.1145/3308558.3313555","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3308558.3313555","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The World Wide Web Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3308558.3313555","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Wenqing Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I2250653659","display_name":"Tencent (China)","ror":"https://ror.org/00hhjss72","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250653659"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wenqing Lin","raw_affiliation_strings":["Tencent, China"],"affiliations":[{"raw_affiliation_string":"Tencent, China","institution_ids":["https://openalex.org/I2250653659"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2250653659"],"apc_list":null,"apc_paid":null,"fwci":1.6348,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.87044502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1084","last_page":"1094"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.796999990940094},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.6331999897956848},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5999000072479248},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5953999757766724},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.5837000012397766},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5809000134468079},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4296000003814697}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8174999952316284},{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.796999990940094},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6331999897956848},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5999000072479248},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5953999757766724},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.5837000012397766},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5809000134468079},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5551999807357788},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4296000003814697},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4219000041484833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4106000065803528},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4059999883174896},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3806999921798706},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.29670000076293945},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.2651999890804291},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.25839999318122864},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2574000060558319},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25130000710487366},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3308558.3313555","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3308558.3313555","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The World Wide Web Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1903.11749","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1903.11749","pdf_url":"https://arxiv.org/pdf/1903.11749","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3308558.3313555","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3308558.3313555","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The World Wide Web Conference","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1030133576","https://openalex.org/W1972856721","https://openalex.org/W1974753421","https://openalex.org/W2037963635","https://openalex.org/W2048827284","https://openalex.org/W2057958327","https://openalex.org/W2059710495","https://openalex.org/W2116940697","https://openalex.org/W2128119682","https://openalex.org/W2129565593","https://openalex.org/W2133299088","https://openalex.org/W2170616854","https://openalex.org/W2387255728","https://openalex.org/W2512066066","https://openalex.org/W2513566807","https://openalex.org/W2532651855","https://openalex.org/W2576295605","https://openalex.org/W2612259229","https://openalex.org/W2613777234","https://openalex.org/W2743489687","https://openalex.org/W2798750142","https://openalex.org/W2963921057","https://openalex.org/W2997134027","https://openalex.org/W4206219939","https://openalex.org/W4298292701"],"related_works":[],"abstract_inverted_index":{"Personalized":[0],"PageRank":[1],"(PPR)":[2],"has":[3],"enormous":[4],"applications,":[5],"such":[6],"as":[7],"link":[8],"prediction":[9],"and":[10,130,183,225],"recommendation":[11],"systems":[12],"for":[13,172],"social":[14],"networks,":[15],"which":[16,154],"often":[17],"require":[18],"the":[19,33,38,48,65,71,95,105,112,128,132,138,143,157,165,178,186,199,223,229],"fully":[20,49,98,144],"PPR":[21,100],"to":[22,46,56,136,191],"be":[23],"known.":[24],"Besides,":[25],"most":[26,59],"of":[27,67,97,121,127,142,159,180,188,207,219,234],"real-life":[28,208],"graphs":[29,76,103],"are":[30],"edge-weighted,":[31],"e.g.,":[32],"interaction":[34],"between":[35],"users":[36],"on":[37,52,80,94,101,147,204],"Facebook":[39],"network.":[40],"However,":[41],"it":[42],"is":[43,216],"computationally":[44],"difficult":[45],"compute":[47,192],"PPR,":[50],"especially":[51],"large":[53,102,119,160],"graphs,":[54],"not":[55,63],"mention":[57],"that":[58,116,162,175,196,213],"existing":[60,72],"approaches":[61],"do":[62],"consider":[64],"weights":[66],"edges.":[68],"In":[69],"particular,":[70],"approach":[73],"cannot":[74],"handle":[75],"with":[77],"billion":[78],"edges":[79],"a":[81,91,118,205],"moderate-size":[82],"cluster.":[83],"To":[84],"address":[85],"this":[86,88],"problem,":[87],"paper":[89],"presents":[90],"novel":[92],"study":[93],"computation":[96,179],"edge-weighted":[99],"using":[104],"distributed":[106],"computing":[107],"framework.":[108],"Specifically,":[109],"we":[110,149,211],"employ":[111],"Monte":[113],"Carlo":[114],"approximation":[115],"performs":[117],"number":[120],"random":[122,181,189],"walks":[123,171,190],"from":[124],"each":[125,194],"node":[126],"graph,":[129],"exploits":[131],"parallel":[133],"pipeline":[134,195],"framework":[135],"reduce":[137],"overall":[139],"running":[140],"time":[141],"PPR.":[145],"Based":[146],"that,":[148],"develop":[150],"several":[151,217],"optimization":[152],"techniques":[153],"(i)":[155],"alleviate":[156],"issue":[158],"nodes":[161,174],"could":[163],"explode":[164],"memory":[166],"space,":[167],"(ii)":[168],"pre-compute":[169],"short":[170],"small":[173],"largely":[176,227],"speedup":[177],"walks,":[182],"(iii)":[184],"optimize":[185],"amount":[187],"in":[193,232],"significantly":[197],"reduces":[198],"overhead.":[200],"With":[201],"extensive":[202],"experiments":[203],"variety":[206],"graph":[209],"datasets,":[210],"demonstrate":[212],"our":[214],"solution":[215],"orders":[218],"magnitude":[220],"faster":[221],"than":[222],"state-of-the-arts,":[224],"meanwhile,":[226],"outperforms":[228],"baseline":[230],"algorithms":[231],"terms":[233],"accuracy.":[235]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-02-21T00:00:00"}