{"id":"https://openalex.org/W4200495572","doi":"https://doi.org/10.1109/hpec49654.2021.9622840","title":"An Efficient Algorithm for the Construction of Dynamically Updating Trajectory Networks","display_name":"An Efficient Algorithm for the Construction of Dynamically Updating Trajectory Networks","publication_year":2021,"publication_date":"2021-09-20","ids":{"openalex":"https://openalex.org/W4200495572","doi":"https://doi.org/10.1109/hpec49654.2021.9622840"},"language":"en","primary_location":{"id":"doi:10.1109/hpec49654.2021.9622840","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec49654.2021.9622840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 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/A5002144478","display_name":"Deniz Gurevin","orcid":"https://orcid.org/0000-0002-7691-3530"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Deniz Gurevin","raw_affiliation_strings":["Electrical and Computer Engineering, University of Connecticut, CT, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, University of Connecticut, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026426371","display_name":"Chris J. Michael","orcid":null},"institutions":[{"id":"https://openalex.org/I2802384920","display_name":"Stennis Space Center","ror":"https://ror.org/03j9e2j92","country_code":"US","type":"facility","lineage":["https://openalex.org/I2802384920","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris J. Michael","raw_affiliation_strings":["U.S. Naval Research Laboratory, Stennis Space Center, MS, USA"],"affiliations":[{"raw_affiliation_string":"U.S. Naval Research Laboratory, Stennis Space Center, MS, USA","institution_ids":["https://openalex.org/I2802384920"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048129220","display_name":"Omer Khan","orcid":"https://orcid.org/0000-0001-6293-7403"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Omer Khan","raw_affiliation_strings":["Electrical and Computer Engineering, University of Connecticut, CT, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, University of Connecticut, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002144478"],"corresponding_institution_ids":["https://openalex.org/I140172145"],"apc_list":null,"apc_paid":null,"fwci":0.1524,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47748479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.998199999332428,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.8810267448425293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8078159093856812},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5479131937026978},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5182285308837891},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47664815187454224},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.4605725109577179},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45059287548065186},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.43824300169944763},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4283272624015808},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4267207086086273},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2594776749610901},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09665903449058533},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08845105767250061}],"concepts":[{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.8810267448425293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8078159093856812},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5479131937026978},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5182285308837891},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47664815187454224},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.4605725109577179},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45059287548065186},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.43824300169944763},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4283272624015808},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4267207086086273},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2594776749610901},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09665903449058533},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08845105767250061},{"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec49654.2021.9622840","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec49654.2021.9622840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1922838137","https://openalex.org/W1967570846","https://openalex.org/W1970206276","https://openalex.org/W1970754929","https://openalex.org/W1981398125","https://openalex.org/W1981599289","https://openalex.org/W2002564706","https://openalex.org/W2002576896","https://openalex.org/W2015378554","https://openalex.org/W2040395913","https://openalex.org/W2063295648","https://openalex.org/W2087194317","https://openalex.org/W2094511120","https://openalex.org/W2118269922","https://openalex.org/W2119368079","https://openalex.org/W2120436185","https://openalex.org/W2154191591","https://openalex.org/W2158432527","https://openalex.org/W2171707538","https://openalex.org/W2255845836","https://openalex.org/W2280777305","https://openalex.org/W2327974553","https://openalex.org/W2519586580","https://openalex.org/W2532516272","https://openalex.org/W2562676961","https://openalex.org/W2609630732","https://openalex.org/W2823573924","https://openalex.org/W2911937761","https://openalex.org/W2964160397","https://openalex.org/W3049667020","https://openalex.org/W6665613084","https://openalex.org/W6737089096"],"related_works":["https://openalex.org/W2366107444","https://openalex.org/W4388145910","https://openalex.org/W2381570729","https://openalex.org/W1976205134","https://openalex.org/W4248336175","https://openalex.org/W2031260042","https://openalex.org/W2391445434","https://openalex.org/W3009369890","https://openalex.org/W4312490297","https://openalex.org/W2062212388"],"abstract_inverted_index":{"Trajectory":[0],"based":[1,23,131,136],"spatiotemporal":[2],"networks":[3,95],"(STN)":[4],"are":[5,43],"useful":[6],"in":[7,60,85,157,161],"a":[8,48,67,72,80,133,158],"wide":[9],"range":[10],"of":[11,20,30,65,100,141,176],"applications,":[12],"such":[13,66],"as":[14,151,180],"crowd":[15],"behavior":[16],"analysis.":[17],"Significant":[18],"portion":[19],"trajectory":[21,68,101,125],"network":[22,37,50,69,122],"research":[24],"focuses":[25],"on":[26,47,132,166],"optimizing":[27],"the":[28,97,167,174,183],"analysis":[29,86],"STN":[31,162,186],"to":[32,92,138,182],"characterize,":[33],"control,":[34],"and":[35,57,76,118,144],"predict":[36],"behavior.":[38],"However,":[39],"these":[40],"mining":[41],"algorithms":[42],"typically":[44],"carried":[45],"out":[46],"pre-constructed":[49],"structure":[51],"that":[52,103,115],"tracks":[53],"all":[54],"moving":[55],"objects":[56],"their":[58,145],"trajectories":[59,143,152],"real":[61],"time.":[62,164],"The":[63,88,127],"construction":[64,163,187],"is":[70,78,91,130],"itself":[71],"computationally":[73],"expensive":[74],"task":[75],"it":[77],"becoming":[79],"bigger":[81],"burden":[82],"with":[83],"advancements":[84],"algorithms.":[87],"traditional":[89],"approach":[90],"construct":[93],"static":[94,184],"from":[96,123],"temporal":[98],"snapshots":[99],"data":[102],"cannot":[104],"handle":[105],"spatiotemporally":[106],"changing":[107],"data.":[108,126],"This":[109],"paper":[110],"proposes":[111],"an":[112,120],"efficient":[113],"algorithm":[114],"successfully":[116],"generates":[117],"maintains":[119],"ST":[121],"raw":[124],"proposed":[128],"method":[129,172],"customized":[134],"R-Tree":[135],"constructor":[137],"keep":[139],"track":[140],"object":[142],"interactions.":[146],"It":[147],"avoids":[148],"redundant":[149],"updates":[150,177],"evolve":[153],"over":[154],"time,":[155],"resulting":[156],"significant":[159],"reduction":[160],"Based":[165],"experiments":[168],"we":[169],"conducted,":[170],"our":[171],"reduces":[173],"number":[175],"by":[178],"71.25%":[179],"compared":[181],"naive":[185],"method.":[188]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}