26 Citations (Scopus)

Abstract

Many applications generate and consume temporal data and retrieval of time series is a key processing step in many application domains. Dynamic time warping (DTW) distance between time series of size N and M is computed relying on a dynamic programming approach which creates and fills an N × M grid to search for an optimal warp path. Since this can be costly, various heuristics have been proposed to cut away the potentially unproductive portions of the DTW grid. In this paper, we argue that time series often carry structural features that can be used for identifying locally relevant constraints to eliminate redundant work. Relying on this observation, we propose salient feature based sDTW algorithms which first identify robust salient features in the given time series and then find a consistent alignment of these to establish the boundaries for the warp path search. More specifically, we propose alternative fixed core&adaptive width, adaptive core&fixed width, and adaptive core&adaptive width strategies which enforce different constraints reflecting the high level structural characteristics of the series in the data set. Experiment results show that the proposed sDTW algorithms help achieve much higher accuracy in DTWcomputation and time series retrieval than fixed core & fixed width algorithms that do not leverage local features of the given time series.

Original languageEnglish (US)
Title of host publicationProceedings of the VLDB Endowment
Pages1519-1530
Number of pages12
Volume5
Edition11
StatePublished - Jul 2012

Fingerprint

Time series
Dynamic programming
Processing
Experiments

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Candan, K., Rossini, R., Sapino, M. L., & Wang, X. (2012). sDTW: Computing DTW distances using locally relevant constraints based on salient feature alignments. In Proceedings of the VLDB Endowment (11 ed., Vol. 5, pp. 1519-1530)

sDTW : Computing DTW distances using locally relevant constraints based on salient feature alignments. / Candan, Kasim; Rossini, Rosaria; Sapino, Maria Luisa; Wang, Xiaolan.

Proceedings of the VLDB Endowment. Vol. 5 11. ed. 2012. p. 1519-1530.

Research output: Chapter in Book/Report/Conference proceedingChapter

Candan, K, Rossini, R, Sapino, ML & Wang, X 2012, sDTW: Computing DTW distances using locally relevant constraints based on salient feature alignments. in Proceedings of the VLDB Endowment. 11 edn, vol. 5, pp. 1519-1530.
Candan K, Rossini R, Sapino ML, Wang X. sDTW: Computing DTW distances using locally relevant constraints based on salient feature alignments. In Proceedings of the VLDB Endowment. 11 ed. Vol. 5. 2012. p. 1519-1530
Candan, Kasim ; Rossini, Rosaria ; Sapino, Maria Luisa ; Wang, Xiaolan. / sDTW : Computing DTW distances using locally relevant constraints based on salient feature alignments. Proceedings of the VLDB Endowment. Vol. 5 11. ed. 2012. pp. 1519-1530
@inbook{9e11890714ef407da02ee4a41575697d,
title = "sDTW: Computing DTW distances using locally relevant constraints based on salient feature alignments",
abstract = "Many applications generate and consume temporal data and retrieval of time series is a key processing step in many application domains. Dynamic time warping (DTW) distance between time series of size N and M is computed relying on a dynamic programming approach which creates and fills an N × M grid to search for an optimal warp path. Since this can be costly, various heuristics have been proposed to cut away the potentially unproductive portions of the DTW grid. In this paper, we argue that time series often carry structural features that can be used for identifying locally relevant constraints to eliminate redundant work. Relying on this observation, we propose salient feature based sDTW algorithms which first identify robust salient features in the given time series and then find a consistent alignment of these to establish the boundaries for the warp path search. More specifically, we propose alternative fixed core&adaptive width, adaptive core&fixed width, and adaptive core&adaptive width strategies which enforce different constraints reflecting the high level structural characteristics of the series in the data set. Experiment results show that the proposed sDTW algorithms help achieve much higher accuracy in DTWcomputation and time series retrieval than fixed core & fixed width algorithms that do not leverage local features of the given time series.",
author = "Kasim Candan and Rosaria Rossini and Sapino, {Maria Luisa} and Xiaolan Wang",
year = "2012",
month = "7",
language = "English (US)",
volume = "5",
pages = "1519--1530",
booktitle = "Proceedings of the VLDB Endowment",
edition = "11",

}

TY - CHAP

T1 - sDTW

T2 - Computing DTW distances using locally relevant constraints based on salient feature alignments

AU - Candan, Kasim

AU - Rossini, Rosaria

AU - Sapino, Maria Luisa

AU - Wang, Xiaolan

PY - 2012/7

Y1 - 2012/7

N2 - Many applications generate and consume temporal data and retrieval of time series is a key processing step in many application domains. Dynamic time warping (DTW) distance between time series of size N and M is computed relying on a dynamic programming approach which creates and fills an N × M grid to search for an optimal warp path. Since this can be costly, various heuristics have been proposed to cut away the potentially unproductive portions of the DTW grid. In this paper, we argue that time series often carry structural features that can be used for identifying locally relevant constraints to eliminate redundant work. Relying on this observation, we propose salient feature based sDTW algorithms which first identify robust salient features in the given time series and then find a consistent alignment of these to establish the boundaries for the warp path search. More specifically, we propose alternative fixed core&adaptive width, adaptive core&fixed width, and adaptive core&adaptive width strategies which enforce different constraints reflecting the high level structural characteristics of the series in the data set. Experiment results show that the proposed sDTW algorithms help achieve much higher accuracy in DTWcomputation and time series retrieval than fixed core & fixed width algorithms that do not leverage local features of the given time series.

AB - Many applications generate and consume temporal data and retrieval of time series is a key processing step in many application domains. Dynamic time warping (DTW) distance between time series of size N and M is computed relying on a dynamic programming approach which creates and fills an N × M grid to search for an optimal warp path. Since this can be costly, various heuristics have been proposed to cut away the potentially unproductive portions of the DTW grid. In this paper, we argue that time series often carry structural features that can be used for identifying locally relevant constraints to eliminate redundant work. Relying on this observation, we propose salient feature based sDTW algorithms which first identify robust salient features in the given time series and then find a consistent alignment of these to establish the boundaries for the warp path search. More specifically, we propose alternative fixed core&adaptive width, adaptive core&fixed width, and adaptive core&adaptive width strategies which enforce different constraints reflecting the high level structural characteristics of the series in the data set. Experiment results show that the proposed sDTW algorithms help achieve much higher accuracy in DTWcomputation and time series retrieval than fixed core & fixed width algorithms that do not leverage local features of the given time series.

UR - http://www.scopus.com/inward/record.url?scp=84873161989&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84873161989&partnerID=8YFLogxK

M3 - Chapter

VL - 5

SP - 1519

EP - 1530

BT - Proceedings of the VLDB Endowment

ER -