{"id":"https://openalex.org/W3051020105","doi":null,"title":"Embedding Graphs for Shortest-Path Distance Predictions","display_name":"Embedding Graphs for Shortest-Path Distance Predictions","alternate_titles":[],"publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3051020105","mag":"3051020105"},"language":"en","primary_location":{"id":"pmh:oai:jupiter.its.unimelb.edu.au:11343/241911","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/11343/241911","pdf_url":null,"source":{"id":"https://openalex.org/S4377196259","display_name":"Minerva Access (University of Melbourne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I165779595","host_organization_name":"The University of Melbourne","host_organization_lineage":["https://openalex.org/I165779595"],"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":"Masters Research thesis"},"parent_works":[],"lineage":["https://openalex.org/W3051020105"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11343/241911","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042518350","display_name":"Zhuowei Zhao","orcid":"https://orcid.org/0000-0002-6891-6432","observed_orcids":["https://orcid.org/0000-0002-6891-6432"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhuowei Zhao","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-6891-6432","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5042518350"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6967999935150146,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.6967999935150146,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.22669999301433563,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.01860000006854534,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/network-embedding","display_name":"graph embedding","score":0.7519999742507935},{"id":"https://openalex.org/keywords/social-recommendation","display_name":"social recommendation","score":0.8560000061988831},{"id":"https://openalex.org/keywords/large-graphs","display_name":"large-scale graphs","score":0.5799999833106995}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7397065758705139},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.6472309827804565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5707988739013672},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5523923635482788},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5316289663314819},{"id":"https://openalex.org/C75564084","wikidata":"https://www.wikidata.org/wiki/Q5597085","display_name":"Graph embedding","level":3,"score":0.5225581526756287},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.508665144443512},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48352694511413574},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44499504566192627},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42957496643066406},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.38791540265083313},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3761168122291565},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3547680974006653},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3349677324295044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3343888521194458},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2402709424495697},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.11136248707771301},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:jupiter.its.unimelb.edu.au:11343/241911","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/11343/241911","pdf_url":null,"source":{"id":"https://openalex.org/S4377196259","display_name":"Minerva Access (University of Melbourne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I165779595","host_organization_name":"The University of Melbourne","host_organization_lineage":["https://openalex.org/I165779595"],"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":"Masters Research thesis"},{"id":"mag:3051020105","doi":null,"is_oa":false,"landing_page_url":"https://minerva-access.unimelb.edu.au/bitstream/handle/11343/241911/379f5ddc-fb4e-ea11-94b5-0050568d7800_Distance_Driven_Graph_Embedding_for_Shortest_path_Distance_Prediction.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:jupiter.its.unimelb.edu.au:11343/241911","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/11343/241911","pdf_url":null,"source":{"id":"https://openalex.org/S4377196259","display_name":"Minerva Access (University of Melbourne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I165779595","host_organization_name":"The University of Melbourne","host_organization_lineage":["https://openalex.org/I165779595"],"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":"Masters Research thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320965","display_name":"University of New South Wales","ror":"https://ror.org/03r8z3t63"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3051020105.pdf","grobid_xml":"https://content.openalex.org/works/W3051020105.grobid-xml"},"referenced_works_count":86,"referenced_works":["https://openalex.org/W348384746","https://openalex.org/W1480376833","https://openalex.org/W1520740947","https://openalex.org/W1593045043","https://openalex.org/W1614298861","https://openalex.org/W1665214252","https://openalex.org/W1905029509","https://openalex.org/W1966292582","https://openalex.org/W1971937094","https://openalex.org/W1972978715","https://openalex.org/W1992709202","https://openalex.org/W1994924587","https://openalex.org/W2002722727","https://openalex.org/W2005945380","https://openalex.org/W2006097619","https://openalex.org/W2007572995","https://openalex.org/W2008196645","https://openalex.org/W2019003829","https://openalex.org/W2026417691","https://openalex.org/W2033447978","https://openalex.org/W2035494495","https://openalex.org/W2044012461","https://openalex.org/W2044124294","https://openalex.org/W2045446569","https://openalex.org/W2050576295","https://openalex.org/W2052569240","https://openalex.org/W2053186076","https://openalex.org/W2056944867","https://openalex.org/W2063491776","https://openalex.org/W2069870183","https://openalex.org/W2084224084","https://openalex.org/W2088412871","https://openalex.org/W2090891622","https://openalex.org/W2091825929","https://openalex.org/W2093402979","https://openalex.org/W2098636939","https://openalex.org/W2100495367","https://openalex.org/W2100805904","https://openalex.org/W2110889574","https://openalex.org/W2112513979","https://openalex.org/W2116437000","https://openalex.org/W2117234597","https://openalex.org/W2118440866","https://openalex.org/W2125580539","https://openalex.org/W2127151074","https://openalex.org/W2132092465","https://openalex.org/W2132914434","https://openalex.org/W2134370969","https://openalex.org/W2134479550","https://openalex.org/W2142126162","https://openalex.org/W2142535891","https://openalex.org/W2143704018","https://openalex.org/W2146583842","https://openalex.org/W2148831787","https://openalex.org/W2152306920","https://openalex.org/W2154454189","https://openalex.org/W2154851992","https://openalex.org/W2155806188","https://openalex.org/W2156718197","https://openalex.org/W2157082398","https://openalex.org/W2159394589","https://openalex.org/W2161638904","https://openalex.org/W2163922914","https://openalex.org/W2167917621","https://openalex.org/W2169528473","https://openalex.org/W2171707538","https://openalex.org/W2172107427","https://openalex.org/W2294347342","https://openalex.org/W2294798173","https://openalex.org/W2387462954","https://openalex.org/W2393319904","https://openalex.org/W2471223835","https://openalex.org/W2519887557","https://openalex.org/W2612872092","https://openalex.org/W2755092149","https://openalex.org/W2761908665","https://openalex.org/W2764587448","https://openalex.org/W2898210895","https://openalex.org/W2962756421","https://openalex.org/W2963224980","https://openalex.org/W3136668146","https://openalex.org/W3151628504","https://openalex.org/W4247782380","https://openalex.org/W4249736682","https://openalex.org/W4251692629","https://openalex.org/W4394108369"],"related_works":["https://openalex.org/W3013788610","https://openalex.org/W4388341240","https://openalex.org/W4303946184","https://openalex.org/W2793464101","https://openalex.org/W2898210895","https://openalex.org/W2018146256","https://openalex.org/W2775445478","https://openalex.org/W2950459735","https://openalex.org/W2312755308","https://openalex.org/W2354160165"],"abstract_inverted_index":{"Graph":[0],"is":[1,7],"an":[2,10],"important":[3],"data":[4],"structure":[5],"and":[6,20,73],"used":[8],"in":[9],"abundance":[11],"of":[12,50],"real-world":[13],"applications":[14],"including":[15],"navigation":[16],"systems,":[17],"social":[18,55],"networks,":[19],"web":[21],"search":[22],"engines,":[23],"just":[24],"to":[25,68],"name":[26],"but":[27],"a":[28,31,60],"few.We":[29],"study":[30],"classic":[32],"graph":[33,36,67],"problem":[34,39],"-computing":[35],"shortest-path":[37,61],"distances.This":[38],"has":[40],"many":[41],"applications,":[42],"such":[43],"as":[44],"finding":[45],"nearest":[46],"neighbors":[47],"for":[48],"place":[49],"interest":[51],"(POI)":[52],"recommendation":[53],"or":[54],"network":[56],"friendship":[57],"recommendation.To":[58],"compute":[59],"distance,":[62],"traditional":[63],"approaches":[64,78],"traverse":[65],"the":[66,70,75],"find":[69],"shortest":[71],"path":[72,76],"return":[74],"length.These":[77],"lack":[79],"time":[80],"efficiency":[81],"over":[82],"large":[83],"Contents":[84],"1":[85],"Introduction":[86],"1.1":[87],"Background":[88],".":[89,90,91,92,93,94]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3051020105","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2020-08-24T00:00:00"}
