Similarity search for spatial trajectories using online lower bounding DTW and presorting strategies

Zur Kurzanzeige

dc.identifier.uri http://dx.doi.org/10.15488/2112
dc.identifier.uri http://www.repo.uni-hannover.de/handle/123456789/2137
dc.contributor.author Kiermeier, Marie
dc.contributor.author Werner, Martin
dc.contributor.editor Schewe, Sven
dc.contributor.editor Schneider, Thomas
dc.contributor.editor Wijsen, Jef
dc.date.accessioned 2017-10-24T08:25:16Z
dc.date.available 2017-10-24T08:25:16Z
dc.date.issued 2017
dc.identifier.citation Kiermeier, M.; Werner, M.: Similarity search for spatial trajectories using online lower bounding DTW and presorting strategies. In: Leibniz International Proceedings in Informatics, LIPIcs 90 (2017), 18. DOI: https://doi.org/10.4230/LIPIcs.TIME.2017.18
dc.description.abstract Similarity search with respect to time series has received much attention from research and industry in the last decade. Dynamic time warping is one of the most widely used distance measures in this context. This is due to the simplicity of its definition and the surprising quality of dynamic time warping for time series classification. However, dynamic time warping is not well-behaving with respect to many dimensionality reduction techniques as it does not fulfill the triangle inequality. Additionally, most research on dynamic time warping has been performed with one-dimensional time series or in multivariate cases of varying dimensions. With this paper, we propose three extensions to LBRotation for two-dimensional time series (trajectories). We simplify LBRotation and adapt it to the online and data streaming case and show how to tune the pruning ratio in similarity search by using presorting strategies based on simple summaries of trajectories. Finally, we provide a thorough evaluation of these aspects on a large variety of datasets of spatial trajectories. eng
dc.language.iso eng
dc.publisher Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH
dc.relation.ispartof 24th International Symposium on Temporal Representation and Reasoning (TIME 2017)
dc.relation.ispartofseries Leibniz international proceedings in informatics : LIPIcs ; 90
dc.rights CC BY 3.0 Unported
dc.rights.uri https://creativecommons.org/licenses/by/3.0/
dc.subject Trajectory Computing eng
dc.subject Similarity Search eng
dc.subject Dynamic Time Warping eng
dc.subject Lower Bounds eng
dc.subject k Nearest Neighbor Search eng
dc.subject Spatial Presorting eng
dc.subject Konferenzschrift ger
dc.subject.classification Konferenzschrift ger
dc.subject.ddc 004 | Informatik ger
dc.title Similarity search for spatial trajectories using online lower bounding DTW and presorting strategies eng
dc.type BookPart
dc.type Text
dc.relation.essn 1868-8969
dc.relation.isbn 978-3-95977-052-1
dc.relation.doi https://doi.org/10.4230/LIPIcs.TIME.2017.18
dc.bibliographicCitation.volume 90
dc.bibliographicCitation.firstPage 18
dc.description.version publishedVersion
tib.accessRights frei zug�nglich


Die Publikation erscheint in Sammlung(en):

Zur Kurzanzeige

 

Suche im Repositorium


Durchblättern

Mein Nutzer/innenkonto

Nutzungsstatistiken