{"id":"https://openalex.org/W4403577385","doi":"https://doi.org/10.1145/3627673.3679976","title":"P-Rank+: A Scalable Efficient P-Rank Search Algorithm","display_name":"P-Rank+: A Scalable Efficient P-Rank Search Algorithm","publication_year":2024,"publication_date":"2024-10-20","ids":{"openalex":"https://openalex.org/W4403577385","doi":"https://doi.org/10.1145/3627673.3679976"},"language":"en","primary_location":{"id":"doi:10.1145/3627673.3679976","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3627673.3679976","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":"Proceedings of the 33rd ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3627673.3679976","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038795382","display_name":"Maoyin Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Maoyin Zhang","raw_affiliation_strings":["Nanjing University of Sci. &amp; Tech., Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University of Sci. &amp; Tech., Jiangsu, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102858336","display_name":"Weiren Yu","orcid":"https://orcid.org/0000-0002-1082-9475"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Weiren Yu","raw_affiliation_strings":["Warwick University, Coventry, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Warwick University, Coventry, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038795382"],"corresponding_institution_ids":["https://openalex.org/I36399199"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16302833,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4278","last_page":"4282"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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/T11550","display_name":"Text and Document Classification Technologies","score":0.9922999739646912,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9914000034332275,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.8153146505355835},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7094299793243408},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.607033371925354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47558391094207764},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3603138327598572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30157095193862915},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2329695224761963},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.06987559795379639}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.8153146505355835},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7094299793243408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.607033371925354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47558391094207764},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3603138327598572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30157095193862915},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2329695224761963},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.06987559795379639}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3627673.3679976","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3627673.3679976","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":"Proceedings of the 33rd ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3627673.3679976","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3627673.3679976","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":"Proceedings of the 33rd ACM International Conference on Information and Knowledge Management","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W125066718","https://openalex.org/W1888005072","https://openalex.org/W2117831564","https://openalex.org/W2152407760","https://openalex.org/W2154851992","https://openalex.org/W2605234117","https://openalex.org/W2788614083","https://openalex.org/W2962756421","https://openalex.org/W2995959085","https://openalex.org/W3098702884","https://openalex.org/W3104097132","https://openalex.org/W4224308422","https://openalex.org/W4372267129"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"P-Rank":[0,45,80,86,101],"(Penetrating-Rank)":[1],"is":[2,150],"a":[3,75,94],"charming":[4],"measure":[5],"of":[6,78,111,123,153],"structural":[7],"similarity":[8],"between":[9],"objects":[10,22,33],"based":[11],"on":[12,66,106,144,164],"graph":[13,125],"topology.":[14],"It":[15],"recursively":[16],"follows":[17],"the":[18,55,79,124,131,157],"principle":[19],"that":[20,148],"\"two":[21],"are":[23,29],"considered":[24],"similar":[25,32,38],"if":[26],"(a)":[27],"they":[28,36],"referenced":[30],"by":[31,118],"and":[34,82,96],"(b)":[35],"reference":[37],"objects''.":[39],"The":[40],"best-known":[41,158],"algorithm":[42,72,98],"for":[43,99,140],"computing":[44,100],"employs":[46],"two":[47],"repeated":[48],"Singular":[49],"Value":[50],"Decompositions":[51],"(SVDs)":[52],"coupled":[53],"with":[54,109,127],"Woodbury":[56],"matrix":[57],"identity.":[58],"However,":[59],"this":[60,71,89],"method":[61],"does":[62],"not":[63],"scale":[64],"well":[65,105],"billion-sized":[67],"graphs.":[68,166],"Worse":[69],"yet,":[70],"only":[73,120],"provides":[74],"linear":[76],"approximation":[77],"model":[81],"cannot":[83],"deliver":[84],"accurate":[85],"values.":[87],"In":[88],"paper,":[90],"we":[91,135],"propose":[92],"P-Rank+,":[93],"fast":[95],"efficient":[97],"similarities,":[102],"which":[103],"scales":[104],"large":[107],"graphs":[108],"billions":[110],"edges.":[112],"P-Rank+":[113,141,149],"leverages":[114],"dimensionality":[115],"reduction":[116],"techniques":[117],"performing":[119],"one":[121],"SVD":[122],"integrated":[126],"Hadamard":[128],"products":[129],"in":[130],"reduced":[132],"subspace.":[133],"Moreover,":[134],"provide":[136],"provable":[137],"error":[138],"guarantees":[139],"computation.":[142],"Experiments":[143],"various":[145],"datasets":[146],"validate":[147],"1--3":[151],"orders":[152],"magnitude":[154],"faster":[155],"than":[156],"competitor":[159],"while":[160],"achieving":[161],"excellent":[162],"scalability":[163],"massive":[165]},"counts_by_year":[],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}
