Scaling up Dynamic Time Warping to Massive Datasets

  • Eamonn J. Keogh
  • Michael J. Pazzani
Conference paper

DOI: 10.1007/978-3-540-48247-5_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1704)
Cite this paper as:
Keogh E.J., Pazzani M.J. (1999) Scaling up Dynamic Time Warping to Massive Datasets. In: Żytkow J.M., Rauch J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1999. Lecture Notes in Computer Science, vol 1704. Springer, Berlin, Heidelberg

Abstract

There has been much recent interest in adapting data mining algorithms to time series databases. Many of these algorithms need to compare time series. Typically some variation or extension of Euclidean distance is used. However, as we demonstrate in this paper, Euclidean distance can be an extremely brittle distance measure. Dynamic time warping (DTW) has been suggested as a technique to allow more robust distance calculations, however it is computationally expensive. In this paper we introduce a modification of DTW which operates on a higher level abstraction of the data, in particular, a piecewise linear representation. We demonstrate that our approach allows us to outperform DTW by one to three orders of magnitude. We experimentally evaluate our approach on medical, astronomical and sign language data.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Eamonn J. Keogh
    • 1
  • Michael J. Pazzani
    • 1
  1. 1.Department of Information and Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations