{"id":"https://openalex.org/W2011809582","doi":"https://doi.org/10.1007/s10115-010-0333-9","title":"Mining fastest path from trajectories with multiple destinations in road networks","display_name":"Mining fastest path from trajectories with multiple destinations in road networks","publication_year":2010,"publication_date":"2010-08-07","ids":{"openalex":"https://openalex.org/W2011809582","doi":"https://doi.org/10.1007/s10115-010-0333-9","mag":"2011809582"},"language":"en","primary_location":{"id":"doi:10.1007/s10115-010-0333-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10115-010-0333-9","pdf_url":null,"source":{"id":"https://openalex.org/S81770430","display_name":"Knowledge and Information Systems","issn_l":"0219-1377","issn":["0219-1377","0219-3116"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Knowledge and Information Systems","raw_type":"journal-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/A5016769632","display_name":"Eric Hsueh-Chan Lu","orcid":"https://orcid.org/0000-0002-5342-9383"},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Eric Hsueh-Chan Lu","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan, ROC","National Cheng Kung University, Department of Computer Science and Information Engineering, Tainan, Taiwan, ROC#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan, ROC","institution_ids":["https://openalex.org/I91807558"]},{"raw_affiliation_string":"National Cheng Kung University, Department of Computer Science and Information Engineering, Tainan, Taiwan, ROC#TAB#","institution_ids":["https://openalex.org/I91807558"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091716232","display_name":"Wang-Chien Lee","orcid":"https://orcid.org/0000-0002-8949-489X"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wang-Chien Lee","raw_affiliation_strings":["Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA, 16802, USA","Pennsylvania State University, Department of Computer Science and Engineering, 16802, University Park, PA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA, 16802, USA","institution_ids":["https://openalex.org/I130769515"]},{"raw_affiliation_string":"Pennsylvania State University, Department of Computer Science and Engineering, 16802, University Park, PA, USA#TAB#","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043399804","display_name":"Vincent S. Tseng","orcid":"https://orcid.org/0000-0002-4853-1594"},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Vincent S. Tseng","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan, ROC","National Cheng Kung University, Department of Computer Science and Information Engineering, Tainan, Taiwan, ROC#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan, ROC","institution_ids":["https://openalex.org/I91807558"]},{"raw_affiliation_string":"National Cheng Kung University, Department of Computer Science and Information Engineering, Tainan, Taiwan, ROC#TAB#","institution_ids":["https://openalex.org/I91807558"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043399804"],"corresponding_institution_ids":["https://openalex.org/I91807558"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":2.4321,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.88346636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"1","first_page":"25","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9976999759674072,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.7268878221511841},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6765881776809692},{"id":"https://openalex.org/keywords/destinations","display_name":"Destinations","score":0.6010139584541321},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.595365047454834},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5010986328125},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4647974371910095},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4615284502506256},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4382578134536743},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4276324510574341},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41310831904411316},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2931455671787262},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23605865240097046},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16627761721611023},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1509704887866974},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.14476323127746582},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1294475495815277},{"id":"https://openalex.org/keywords/tourism","display_name":"Tourism","score":0.1097845733165741}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7268878221511841},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6765881776809692},{"id":"https://openalex.org/C2776687071","wikidata":"https://www.wikidata.org/wiki/Q5265193","display_name":"Destinations","level":3,"score":0.6010139584541321},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.595365047454834},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5010986328125},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4647974371910095},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4615284502506256},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4382578134536743},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4276324510574341},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41310831904411316},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2931455671787262},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23605865240097046},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16627761721611023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1509704887866974},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.14476323127746582},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1294475495815277},{"id":"https://openalex.org/C18918823","wikidata":"https://www.wikidata.org/wiki/Q49389","display_name":"Tourism","level":2,"score":0.1097845733165741},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10115-010-0333-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10115-010-0333-9","pdf_url":null,"source":{"id":"https://openalex.org/S81770430","display_name":"Knowledge and Information Systems","issn_l":"0219-1377","issn":["0219-1377","0219-3116"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Knowledge and Information Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.717.152","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.717.152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://idb.csie.ncku.edu.tw/paper/journal/Mining%20Fastest%20Path%20from%20Trajectories%20with%20Multiple%20Destinations%20in%20Road%20Networks.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W187767610","https://openalex.org/W1493454437","https://openalex.org/W1496431500","https://openalex.org/W1519514048","https://openalex.org/W1519770485","https://openalex.org/W1543335880","https://openalex.org/W1608802374","https://openalex.org/W1928910165","https://openalex.org/W1969483458","https://openalex.org/W1989037929","https://openalex.org/W1990300234","https://openalex.org/W2011039300","https://openalex.org/W2015051225","https://openalex.org/W2022179164","https://openalex.org/W2047533111","https://openalex.org/W2065349406","https://openalex.org/W2065768403","https://openalex.org/W2070406401","https://openalex.org/W2078498057","https://openalex.org/W2079274727","https://openalex.org/W2095742267","https://openalex.org/W2101906654","https://openalex.org/W2106745518","https://openalex.org/W2109182426","https://openalex.org/W2111160151","https://openalex.org/W2117954767","https://openalex.org/W2129936293","https://openalex.org/W2136866103","https://openalex.org/W2138459266","https://openalex.org/W2139880890","https://openalex.org/W2140251882","https://openalex.org/W2142578973","https://openalex.org/W2146821198","https://openalex.org/W2156705969","https://openalex.org/W2158454296","https://openalex.org/W2162031086","https://openalex.org/W2165142526","https://openalex.org/W2166559705","https://openalex.org/W2169528473","https://openalex.org/W2476096155","https://openalex.org/W2494779131","https://openalex.org/W2611831635","https://openalex.org/W2956015669","https://openalex.org/W2998574808","https://openalex.org/W2999729612","https://openalex.org/W4243318556","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W3139139461","https://openalex.org/W2904203243","https://openalex.org/W2125569607","https://openalex.org/W2084091668","https://openalex.org/W3204808601"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}