{"id":"https://openalex.org/W2898210895","doi":"https://doi.org/10.1109/asonam.2018.8508763","title":"Shortest Path Distance Approximation Using Deep Learning Techniques","display_name":"Shortest Path Distance Approximation Using Deep Learning Techniques","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2898210895","doi":"https://doi.org/10.1109/asonam.2018.8508763","mag":"2898210895"},"language":"en","primary_location":{"id":"doi:10.1109/asonam.2018.8508763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asonam.2018.8508763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2002.05257","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Fatemeh Salehi Rizi","orcid":null},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fatemeh Salehi Rizi","raw_affiliation_strings":["Department of Computer Science and Mathematics, University of Passau, Passau, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, University of Passau, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Joerg Schloetterer","orcid":null},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Joerg Schloetterer","raw_affiliation_strings":["Department of Computer Science and Mathematics, University of Passau, Passau, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, University of Passau, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"last","author":{"id":null,"display_name":"Michael Granitzer","orcid":null},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Granitzer","raw_affiliation_strings":["Department of Computer Science and Mathematics, University of Passau, Passau, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, University of Passau, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I186354981"],"apc_list":null,"apc_paid":null,"fwci":0.6792,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.75615078,"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":"1007","last_page":"1014"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7770000100135803},{"id":"https://openalex.org/keywords/deep-learning","display_name":"Deep learning","score":0.6371999979019165},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5295000076293945},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4537000060081482},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4081999957561493},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4074999988079071},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.3921999931335449},{"id":"https://openalex.org/keywords/feedforward-neural-network","display_name":"Feedforward neural network","score":0.3903999924659729}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7770000100135803},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.6371999979019165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5698999762535095},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5649999976158142},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5295000076293945},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4537000060081482},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4505000114440918},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4081999957561493},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.3921999931335449},{"id":"https://openalex.org/C47702885","wikidata":"https://www.wikidata.org/wiki/Q5441227","display_name":"Feedforward neural network","level":3,"score":0.3903999924659729},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3903999924659729},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3862999975681305},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.3686999976634979},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.35120001435279846},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.34689998626708984},{"id":"https://openalex.org/C126780896","wikidata":"https://www.wikidata.org/wiki/Q899871","display_name":"Distortion (music)","level":4,"score":0.3271999955177307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3255000114440918},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.3131999969482422},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C2984842247","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep neural networks","level":3,"score":0.28220000863075256}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/asonam.2018.8508763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asonam.2018.8508763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2002.05257","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.05257","pdf_url":"https://arxiv.org/pdf/2002.05257","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"pmh:oai:arXiv.org:2002.05257","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.05257","pdf_url":"https://arxiv.org/pdf/2002.05257","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W114517082","https://openalex.org/W1888005072","https://openalex.org/W2001141328","https://openalex.org/W2005945380","https://openalex.org/W2008018349","https://openalex.org/W2018049970","https://openalex.org/W2022704179","https://openalex.org/W2052703084","https://openalex.org/W2053186076","https://openalex.org/W2090891622","https://openalex.org/W2098636939","https://openalex.org/W2104577053","https://openalex.org/W2115022330","https://openalex.org/W2126390146","https://openalex.org/W2134262590","https://openalex.org/W2154851992","https://openalex.org/W2159394589","https://openalex.org/W2169140571","https://openalex.org/W2172107427","https://openalex.org/W2217442075","https://openalex.org/W2250539671","https://openalex.org/W2387462954","https://openalex.org/W2393319904","https://openalex.org/W2396014138","https://openalex.org/W2739747431","https://openalex.org/W2758274886","https://openalex.org/W2882319491","https://openalex.org/W2962756421","https://openalex.org/W2963410212","https://openalex.org/W3148981562","https://openalex.org/W4246354968","https://openalex.org/W6637242042","https://openalex.org/W6677505729","https://openalex.org/W6678885109","https://openalex.org/W6682691769","https://openalex.org/W6682755970","https://openalex.org/W6682889407","https://openalex.org/W6683180375","https://openalex.org/W6690230747","https://openalex.org/W6695977759","https://openalex.org/W6716303938","https://openalex.org/W6726873649","https://openalex.org/W6740572265","https://openalex.org/W6783596713"],"related_works":[],"abstract_inverted_index":{"Computing":[0],"shortest":[1,66],"path":[2],"distances":[3,68,84],"between":[4],"nodes":[5],"lies":[6],"at":[7],"the":[8,65,96],"heart":[9],"of":[10],"many":[11],"graph":[12,45],"algorithms":[13],"and":[14,100],"applications.":[15],"Traditional":[16],"exact":[17],"methods":[18,41],"such":[19],"as":[20],"breadth-first-search":[21],"(BFS)":[22],"do":[23],"not":[24],"scale":[25],"up":[26],"to":[27,38,42,63],"contemporary,":[28],"rapidly":[29],"evolving":[30],"today's":[31],"massive":[32],"networks.":[33,103],"Therefore,":[34],"it":[35],"is":[36,93],"required":[37],"find":[39],"approximation":[40],"enable":[43],"scalable":[44],"processing":[46],"with":[47,80,85],"a":[48,75],"significant":[49],"speedup.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"utilize":[55],"vector":[56],"embeddings":[57,81],"learnt":[58],"by":[59],"deep":[60],"learning":[61],"techniques":[62],"approximate":[64,83],"paths":[67],"in":[69],"large":[70],"graphs.":[71],"We":[72],"show":[73],"that":[74],"feedforward":[76],"neural":[77],"network":[78],"fed":[79],"can":[82],"relatively":[86],"low":[87],"distortion":[88],"error.":[89],"The":[90],"suggested":[91],"method":[92],"evaluated":[94],"on":[95],"Facebook,":[97],"BlogCatalog,":[98],"Youtube":[99],"Flickr":[101],"social":[102]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2018-11-02T00:00:00"}