{"id":"https://openalex.org/W3033848929","doi":"https://doi.org/10.1145/3368617","title":"Map-Matching Using Shortest Paths","display_name":"Map-Matching Using Shortest Paths","publication_year":2020,"publication_date":"2020-02-13","ids":{"openalex":"https://openalex.org/W3033848929","doi":"https://doi.org/10.1145/3368617","mag":"3033848929"},"language":"en","primary_location":{"id":"doi:10.1145/3368617","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3368617","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3368617","source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3368617","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011219239","display_name":"Erin Wolf Chambers","orcid":"https://orcid.org/0000-0001-8333-3676"},"institutions":[{"id":"https://openalex.org/I47838141","display_name":"Saint Louis University","ror":"https://ror.org/01p7jjy08","country_code":"US","type":"education","lineage":["https://openalex.org/I47838141"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Erin Chambers","raw_affiliation_strings":["Saint Louis University, St. Louis, MO"],"affiliations":[{"raw_affiliation_string":"Saint Louis University, St. Louis, MO","institution_ids":["https://openalex.org/I47838141"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063015907","display_name":"Brittany Terese Fasy","orcid":"https://orcid.org/0000-0003-1908-0154"},"institutions":[{"id":"https://openalex.org/I23732399","display_name":"Montana State University","ror":"https://ror.org/02w0trx84","country_code":"US","type":"education","lineage":["https://openalex.org/I23732399","https://openalex.org/I4210126032"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brittany Terese Fasy","raw_affiliation_strings":["Montana State University, Bozeman, MT"],"affiliations":[{"raw_affiliation_string":"Montana State University, Bozeman, MT","institution_ids":["https://openalex.org/I23732399"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101536052","display_name":"Yusu Wang","orcid":"https://orcid.org/0000-0001-7950-4348"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yusu Wang","raw_affiliation_strings":["Ohio State University, Columbus, OH"],"affiliations":[{"raw_affiliation_string":"Ohio State University, Columbus, OH","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054903605","display_name":"Carola Wenk","orcid":"https://orcid.org/0000-0001-9275-5336"},"institutions":[{"id":"https://openalex.org/I114832834","display_name":"Tulane University","ror":"https://ror.org/04vmvtb21","country_code":"US","type":"education","lineage":["https://openalex.org/I114832834"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carola Wenk","raw_affiliation_strings":["Tulane University, New Orleans, LA"],"affiliations":[{"raw_affiliation_string":"Tulane University, New Orleans, LA","institution_ids":["https://openalex.org/I114832834"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011219239"],"corresponding_institution_ids":["https://openalex.org/I47838141"],"apc_list":null,"apc_paid":null,"fwci":0.6092,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.66042676,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"1","first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/map-matching","display_name":"Map matching","score":0.8455906510353088},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7074791193008423},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7019274234771729},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.6262804269790649},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5914773941040039},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5477131009101868},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5220662951469421},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48995891213417053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4663127362728119},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43950605392456055},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.43351978063583374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42233386635780334},{"id":"https://openalex.org/keywords/global-positioning-system","display_name":"Global Positioning System","score":0.3786105513572693},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3302140235900879},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26261037588119507},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.12735259532928467}],"concepts":[{"id":"https://openalex.org/C2778559875","wikidata":"https://www.wikidata.org/wiki/Q1892023","display_name":"Map matching","level":3,"score":0.8455906510353088},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7074791193008423},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7019274234771729},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.6262804269790649},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5914773941040039},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5477131009101868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5220662951469421},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48995891213417053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4663127362728119},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43950605392456055},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.43351978063583374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42233386635780334},{"id":"https://openalex.org/C60229501","wikidata":"https://www.wikidata.org/wiki/Q18822","display_name":"Global Positioning System","level":2,"score":0.3786105513572693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3302140235900879},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26261037588119507},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.12735259532928467},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3368617","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3368617","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3368617","source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3368617","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3368617","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3368617","source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G1486130212","display_name":"AF: Small: Collaborative Research: Geometric and Topological Algorithms for Analyzing Road Network Data","funder_award_id":"1618605","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1534949823","display_name":null,"funder_award_id":"CCF-1618469","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1822836026","display_name":"CGV: Small: Collaborative Research: Theories, algorithms, and applications of medial forms for shape analysis","funder_award_id":"1319944","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2348538006","display_name":null,"funder_award_id":"DBI-1759807","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3778806257","display_name":"AF: Small: Collaborative Research:Geometric and topological algorithms for analyzing road network data","funder_award_id":"1618247","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4614525016","display_name":null,"funder_award_id":"CCF-1054779","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6562112540","display_name":null,"funder_award_id":"CCF-1614562","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G696432143","display_name":"AF: Small: Extending algorithms for topological notions of similarity","funder_award_id":"1614562","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7722868471","display_name":"AF: Small: Collaborative Research: Geometric and Topological Algorithms for Analyzing Road Network Data","funder_award_id":"1618469","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8635374390","display_name":null,"funder_award_id":"IIS-1319944, CCF-1054779, CCF-1614562, DBI-1759807, CCF-1618605, CCF-1618247, and CCF-1618469","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3033848929.pdf","grobid_xml":"https://content.openalex.org/works/W3033848929.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1502758222","https://openalex.org/W1534215937","https://openalex.org/W1976737199","https://openalex.org/W2031674781","https://openalex.org/W2041866835","https://openalex.org/W2058309190","https://openalex.org/W2067114702","https://openalex.org/W2124299914","https://openalex.org/W2135822894","https://openalex.org/W2153482597","https://openalex.org/W2166771065","https://openalex.org/W2294857104","https://openalex.org/W2395226356","https://openalex.org/W2561675875","https://openalex.org/W2583408848","https://openalex.org/W2612776813","https://openalex.org/W2797779740","https://openalex.org/W3121952561","https://openalex.org/W4244837574","https://openalex.org/W4254070372"],"related_works":["https://openalex.org/W2370431274","https://openalex.org/W2365714035","https://openalex.org/W4381195571","https://openalex.org/W3010912586","https://openalex.org/W2187159411","https://openalex.org/W2541054056","https://openalex.org/W3032870653","https://openalex.org/W2045922748","https://openalex.org/W3149063625","https://openalex.org/W2357644463"],"abstract_inverted_index":{"We":[0,94],"consider":[1,82],"several":[2],"variants":[3],"of":[4,110,117,145],"the":[5,20,36,58,66,72,80,98,108,129,143,146],"map-matching":[6,77,99],"problem,":[7],"which":[8,132],"seeks":[9],"to":[10,23,32,65,97,112],"find":[11,95],"a":[12,24,39,45,50,54,124,134],"path":[13,60,68],"Q":[14,61,92],"in":[15,69,79,86,120],"graph":[16],"G":[17,70,87,121],"that":[18,71],"has":[19,74],"smallest":[21],"distance":[22,125,136],"given":[25],"trajectory":[26,48],"P":[27,43],"(which":[28],"is":[29,133],"likely":[30],"not":[31],"be":[33],"exactly":[34],"on":[35,53],"graph).":[37],"In":[38,104],"typical":[40],"application":[41],"setting,":[42],"models":[44],"noisy":[46],"GPS":[47],"from":[49],"person":[51,73],"traveling":[52],"road":[55],"network,":[56],"and":[57],"desired":[59],"should":[62],"ideally":[63],"correspond":[64],"actual":[67],"traveled.":[75],"Existing":[76],"algorithms":[78],"literature":[81],"all":[83],"possible":[84],"paths":[85,111],"as":[88],"potential":[89],"candidates":[90],"for":[91,138],".":[93,122],"solutions":[96],"problem":[100],"under":[101],"different":[102],"settings.":[103],"particular,":[105],"we":[106,127],"restrict":[107],"set":[109],"shortest":[113,118],"paths,":[114,119],"or":[115],"concatenations":[116],"As":[123],"measure,":[126],"use":[128],"Fr\u00e9chet":[130],"distance,":[131],"suitable":[135],"measure":[137],"curves":[139,147],"since":[140],"it":[141],"takes":[142],"continuity":[144],"into":[148],"account.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}