{"id":"https://openalex.org/W4390188857","doi":"https://doi.org/10.1109/hpec58863.2023.10363460","title":"ANEDA: Adaptable Node Embeddings for Shortest Path Distance Approximation","display_name":"ANEDA: Adaptable Node Embeddings for Shortest Path Distance Approximation","publication_year":2023,"publication_date":"2023-09-25","ids":{"openalex":"https://openalex.org/W4390188857","doi":"https://doi.org/10.1109/hpec58863.2023.10363460"},"language":"en","primary_location":{"id":"doi:10.1109/hpec58863.2023.10363460","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/hpec58863.2023.10363460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093577246","display_name":"Frank Pacini","orcid":null},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Frank Pacini","raw_affiliation_strings":["Boston University,Department of Computer Science,Boston,USA","Department of Computer Science, Boston University, Boston, USA"],"affiliations":[{"raw_affiliation_string":"Boston University,Department of Computer Science,Boston,USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Department of Computer Science, Boston University, Boston, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093577247","display_name":"Allison Gunby-Mann","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Allison Gunby-Mann","raw_affiliation_strings":["Thayer School of Engineering, Darmouth College,Hanover,USA","Thayer School of Engineering, Darmouth College, Hanover, USA"],"affiliations":[{"raw_affiliation_string":"Thayer School of Engineering, Darmouth College,Hanover,USA","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Thayer School of Engineering, Darmouth College, Hanover, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049884582","display_name":"Sarel Cohen","orcid":"https://orcid.org/0000-0003-4578-1245"},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sarel Cohen","raw_affiliation_strings":["Hasso Plattner Institute,Potsdam,Germany","Hasso Plattner Institute, Potsdam, Germany"],"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute,Potsdam,Germany","institution_ids":["https://openalex.org/I143288331"]},{"raw_affiliation_string":"Hasso Plattner Institute, Potsdam, Germany","institution_ids":["https://openalex.org/I143288331"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113696329","display_name":"Peter Chin","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Chin","raw_affiliation_strings":["Thayer School of Engineering, Darmouth College,Hanover,USA","Thayer School of Engineering, Darmouth College, Hanover, USA"],"affiliations":[{"raw_affiliation_string":"Thayer School of Engineering, Darmouth College,Hanover,USA","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Thayer School of Engineering, Darmouth College, Hanover, USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5093577246"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18502034,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9923999905586243,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9923999905586243,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9789999723434448,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9787999987602234,"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/computer-science","display_name":"Computer science","score":0.7002989053726196},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6415271759033203},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.578686535358429},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5367634892463684},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5214542746543884},{"id":"https://openalex.org/keywords/deep-learning","display_name":"Deep learning","score":0.519067108631134},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.45412272214889526},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44458290934562683},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.43718138337135315},{"id":"https://openalex.org/keywords/graph-embedding","display_name":"Graph embedding","score":0.43276864290237427},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4189065396785736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3795899450778961},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34065911173820496}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7002989053726196},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6415271759033203},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.578686535358429},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5367634892463684},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5214542746543884},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.519067108631134},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.45412272214889526},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44458290934562683},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.43718138337135315},{"id":"https://openalex.org/C75564084","wikidata":"https://www.wikidata.org/wiki/Q5597085","display_name":"Graph embedding","level":3,"score":0.43276864290237427},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4189065396785736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3795899450778961},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34065911173820496},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec58863.2023.10363460","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/hpec58863.2023.10363460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2090891622","https://openalex.org/W2142535891","https://openalex.org/W2154851992","https://openalex.org/W2387462954","https://openalex.org/W2549766072","https://openalex.org/W2607500032","https://openalex.org/W2700550412","https://openalex.org/W2755088640","https://openalex.org/W2898210895","https://openalex.org/W2962756421","https://openalex.org/W2963410212","https://openalex.org/W2966694634","https://openalex.org/W2970558762","https://openalex.org/W3013788610","https://openalex.org/W3080334945","https://openalex.org/W3103452448","https://openalex.org/W3104097132","https://openalex.org/W3106263792","https://openalex.org/W6775775685"],"related_works":["https://openalex.org/W3032870653","https://openalex.org/W3149063625","https://openalex.org/W2357644463","https://openalex.org/W3036264823","https://openalex.org/W3206528106","https://openalex.org/W1996697202","https://openalex.org/W2912814903","https://openalex.org/W2123605750","https://openalex.org/W94062305","https://openalex.org/W2088740331"],"abstract_inverted_index":{"Shortest":[0],"path":[1],"distance":[2],"approximation":[3],"is":[4],"a":[5,51,78],"crucial":[6],"aspect":[7],"of":[8,108],"many":[9],"graph":[10,41,59],"algorithms,":[11],"in":[12],"particular":[13],"the":[14,56,66,83,123],"heuristic-based":[15],"routing":[16,89],"algorithms":[17],"that":[18],"make":[19],"fast,":[20],"scalable":[21],"map":[22],"navigation":[23],"possible.":[24],"Past":[25],"literature":[26],"has":[27],"introduced":[28],"deep":[29,87,115],"learning":[30,116],"models":[31],"which":[32,63],"try":[33],"to":[34,86,110],"approximate":[35],"these":[36],"distances":[37],"by":[38],"training":[39,65],"on":[40,96],"embeddings":[42,67],"(i.e.":[43],"node2vec,":[44],"Gra100,":[45],"ProNE,":[46],"Poincare).":[47],"We":[48,81],"propose":[49],"ANEDA,":[50],"more":[52],"lightweight":[53],"technique":[54],"than":[55],"embedding":[57,72],"and":[58,90,99,118],"neural":[60],"network":[61],"scheme,":[62],"involves":[64],"directly,":[68],"using":[69],"either":[70],"previous":[71],"techniques":[73],"or":[74],"geographic":[75],"coordinates":[76],"as":[77],"good":[79],"initialization.":[80],"demonstrate":[82],"applications":[84],"ANEDA":[85],"A*":[88],"learned":[91],"road":[92,98],"maps.":[93],"Through":[94],"experiments":[95],"several":[97],"social":[100],"networks,":[101],"we":[102],"show":[103],"our":[104],"model's":[105],"error":[106],"reduction":[107],"up":[109],"75%":[111],"against":[112,122],"two":[113],"recent":[114],"approaches,":[117],"its":[119],"competitive":[120],"performance":[121],"larger,":[124],"state-of-the-art":[125],"architecture.":[126]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}