Skip to main content

On the Dynamic Time Warping for Computing the Dissimilarity Between Curves

  • Conference paper

Abstract

Dynamic time warping (DTW) is a technique for aligning curves that considers two aspects of variations: horizontal and vertical, or domain and range. This alignment is an essential preliminary in many applications before classification or functional data analysis. A problem with DTW is that the algorithm may fail to find the natural alignment of two series since it is mostly influenced by salient features rather than by the overall shape of the sequences. In this paper, we first deepen the DTW algorithm, showing relationships and differences with the curve registration technique, and then we propose a modification of the algorithm that considers a smoothed version of the data.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • BAY, S. (1999): UCI Repository of Kdd Databases [http://kdd.ics.uci.edu]. Irvine.

    Google Scholar 

  • DE BOOR, C. (1999): Spline Toolbox For Use with Matlab, The Math Works Inc., Natick, MA.

    Google Scholar 

  • HUBERT, L. and ARABIE, P. (1985): Comparing Partitions, IEEE Journal of Classification, Vol. 2, 193–218.

    Article  Google Scholar 

  • KEOGH, E. and PAZZANI, M. (1998): An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback, Proceedings of the Fourth International Conference of Knowledge Discovery and Data Mining, AAAI Press, 239–241.

    Google Scholar 

  • MYERS, C, RABINER, L. and ROSENBERG, A. (1980): Performance tradeoffs in dynamic time warping algorithms for isolated word recognition, IEEE Transactions on Acoustics, Speech and Signal Processing, Vol. ASSP-28, 623–635.

    Article  Google Scholar 

  • MORLINI, I. and ORLANDINI, S. (2001): Multivariate analysis of radar images for environmental monitoring, Metron, vol. LIX, n. 1–2, 169–189.

    MathSciNet  Google Scholar 

  • PICCOLO, D. (1990): A distance measure for classifying ARIMA models, Journal of Time Series Analysis, 5,3, 183–204.

    MathSciNet  Google Scholar 

  • RABINER, L. and JUANG, B. (1993): Fundamentals of Speech Recognition, Englewood Cliffs, N.J., Prentice Hall.

    Google Scholar 

  • RAMSAY, J.O. and LI, X. (1998): Curve registration, J.R.S.S., Series B, 60, 351–363.

    Article  MathSciNet  Google Scholar 

  • RAND, W.M. (1971): Objective criteria for the evaluation of clustering methods, Journal of the American Statistical Association, 66, 846–850.

    Article  Google Scholar 

  • SILVERMAN, B.W. (1995): Incorporating parametric effects into functional principal components analysis, J.R.S.S, Series B, 57, 673–689.

    MATH  Google Scholar 

  • ZANI, S. (2000): Analisi dei dati statistici, vol. II, Giuffrè, Milano.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Morlini, I. (2005). On the Dynamic Time Warping for Computing the Dissimilarity Between Curves. In: Bock, HH., et al. New Developments in Classification and Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27373-5_8

Download citation

Publish with us

Policies and ethics