About: Revisiting Techniques for Lowerbounding the Dynamic Time Warping Distance

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Revisiting Techniques for Lowerbounding the Dynamic Time Warping Distance Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.springerlink.com/content/r18181338j358n00/
Description	The dynamic time warping (DTW) distance has been used as a popular measure to compare similarities of numeric time series because it provides robust matching that recognizes warps in time, different sampling rate, etc. Although DTW computation can be optimized by dynamic programming, it is still expensive, so there have been many attempts proposed to speedup DTW-based similarity search by distance lowerbounding. Some approaches assume a constrained variant of DTW (i.e., fixed dimensions, warping window constraint, ground distance), while others do not. In this paper, we comprehensively revisit the problem of DTW lowerbounding, define a general form of DTW that fits all the existing variants and goes even beyond. For the constrained variants of general DTW we propose a lowerbound construction generalizing the LB_Keogh that for particular ground distances offers speedup by up to two orders of magnitude. Furthermore, we apply metric and ptolemaic lowerbounding on unconstrained variants of general DTW that beats the few existing competitors up to two orders of magnitude. The dynamic time warping (DTW) distance has been used as a popular measure to compare similarities of numeric time series because it provides robust matching that recognizes warps in time, different sampling rate, etc. Although DTW computation can be optimized by dynamic programming, it is still expensive, so there have been many attempts proposed to speedup DTW-based similarity search by distance lowerbounding. Some approaches assume a constrained variant of DTW (i.e., fixed dimensions, warping window constraint, ground distance), while others do not. In this paper, we comprehensively revisit the problem of DTW lowerbounding, define a general form of DTW that fits all the existing variants and goes even beyond. For the constrained variants of general DTW we propose a lowerbound construction generalizing the LB_Keogh that for particular ground distances offers speedup by up to two orders of magnitude. Furthermore, we apply metric and ptolemaic lowerbounding on unconstrained variants of general DTW that beats the few existing competitors up to two orders of magnitude. (en)
Title	Revisiting Techniques for Lowerbounding the Dynamic Time Warping Distance Revisiting Techniques for Lowerbounding the Dynamic Time Warping Distance (en)
skos:prefLabel	Revisiting Techniques for Lowerbounding the Dynamic Time Warping Distance Revisiting Techniques for Lowerbounding the Dynamic Time Warping Distance (en)
skos:notation	RIV/00216208:11320/12:10124012!RIV13-MSM-11320___
http://linked.open...avai/predkladatel	Matematicko-fyzikální fakulta
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...iv/cisloPeriodika	2012
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Skopal, Tomáš Bartoš, Tomáš
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	165433
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/12:10124012
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	efficiency; indexing; Dynamic Time Warping (en)
http://linked.open.../riv/klicoveSlovo	efficiency indexing Dynamic Time Warping
http://linked.open...odStatuVydavatele	DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV	[AED9B4B932F4]
http://linked.open...i/riv/nazevZdroje	Lecture Notes in Computer Science
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	7404
http://linked.open...iv/tvurceVysledku	Skopal, Tomáš Bartoš, Tomáš
issn	0302-9743
number of pages	17 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-32153-5_14
http://localhost/t...ganizacniJednotka	11320
is http://linked.open...avai/riv/vysledek of	Revisiting Techniques for Lowerbounding the Dynamic Time Warping Distance

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software