ANALYSIS OF APPROACHES FOR TRAJECTORY COMPARISON

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86098816" target="_blank" >RIV/61989100:27240/16:86098816 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/16:86098816

Výsledek na webu

<a href="http://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=1&SID=1BkjWpLOEVDNxpCuZKV&page=1&doc=1" target="_blank" >http://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=1&SID=1BkjWpLOEVDNxpCuZKV&page=1&doc=1</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

ANALYSIS OF APPROACHES FOR TRAJECTORY COMPARISON

Popis výsledku v původním jazyce

Measuring similarity between trajectories is undoubtedly one of the most important tasks in trajectory data management since it serves as the foundation of many advanced analyses such as similarity search, clustering, and classification. The paper is focused on distance/metrics to compare two or more trajectories. The authors compared trajectories obtained from several implemented algorithms (Dijkstra's algorithm, A*, Bidirectional Dijkstra, Bidirectional A*) and from external public available routing systems. A collection of the selected routes in the Czech Republic were used for the experiment. The selection of the most suitable metric/distance is very important for the quality enhancement of the routing algorithms; for example, revealing inaccuracies in implemented algorithms or in map data.

Název v anglickém jazyce

ANALYSIS OF APPROACHES FOR TRAJECTORY COMPARISON

Popis výsledku anglicky

Measuring similarity between trajectories is undoubtedly one of the most important tasks in trajectory data management since it serves as the foundation of many advanced analyses such as similarity search, clustering, and classification. The paper is focused on distance/metrics to compare two or more trajectories. The authors compared trajectories obtained from several implemented algorithms (Dijkstra's algorithm, A*, Bidirectional Dijkstra, Bidirectional A*) and from external public available routing systems. A collection of the selected routes in the Czech Republic were used for the experiment. The selection of the most suitable metric/distance is very important for the quality enhancement of the routing algorithms; for example, revealing inaccuracies in implemented algorithms or in map data.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2016

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the third international conference on traffic and transport engineering (ICTTE)

ISBN

978-86-916153-3-8

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

997-1003

Název nakladatele

SCIENTIFIC RESEARCH CENTER LTD BELGRADE

Místo vydání

Bělehrad

Místo konání akce

Bělehrad

Datum konání akce

24. 11. 2016

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

000391016300141