Advertisement

Accurate and Fast Dynamic Time Warping

  • Hailin Li
  • Libin Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8346)

Abstract

Dynamic time warping (DTW) is widely used to measure similarity between two time series by finding an optimal warping path. However, its quadratic time and space complexity are not suitable for large time series datasets. To overcome the issues, we propose a modified version of dynamic time warping, which not only retains the accuracy of DTW but also finds the optimal warping path faster. In the proposed method, a threshold value used to narrow the warping path scope can be preset automatically, thereby resulting in a new method without any parameters. The optimal warping path is found by a backward strategy with reduced scope which is opposite to the forward strategy of DTW. The experimental results demonstrate that besides the same accuracy, the proposed dynamic time warping is faster than DTW, which shows that our method is an improved version of the original one.

Keywords

Dynamic time warping Time series Similarity measure Data mining Computational complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time series databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 419–429 (1994)Google Scholar
  2. 2.
    Chu, S., Keogh, E., Hart, D., Pazzani, M.: Iterative deepening dynamic time warping for time series. In: Proceedings of the Second SIAM International Conference on Data Mining, pp. 195–212 (2002)Google Scholar
  3. 3.
    Chen, L., Ng, R.: On the marriage of Lp-norm and edit distance. In: Proceedings of the 30th International Conference on Very Large Databases, pp. 792–801 (2004)Google Scholar
  4. 4.
    Burnham, K.P., Anderson, D.R.: Kullback-Leibler information as a basis for strong inference in ecological studies. Wildlife Research 28(1), 111–119 (2001)CrossRefGoogle Scholar
  5. 5.
    Keogh, E., Pazzani, M.J.: Derivative dynamic time warping. In: Proceedings of The First SIAM International Conference on Data Mining, pp. 1–11 (2001)Google Scholar
  6. 6.
    Keogh, E.: Exact indexing of dynamic time warping. In: Processings of the 28th International Conference on Very large Data Bases, pp. 358–380 (2005)Google Scholar
  7. 7.
    Lemire, D.: Faster retrieval with a two-pass dynamic-time-warping lower bound. Pattern Recog. 42(9), 2169–2180 (2009)CrossRefzbMATHGoogle Scholar
  8. 8.
    Li, H., Guo, C., Yang, L.: Similarity measure based on piecewise linear approximation and derivative dynamic time warping for time series mining. Expert Systems with Applications 38(12), 14732–14743 (2011)CrossRefGoogle Scholar
  9. 9.
    Petitjean, F., Ketterlin, A., Gancarski, P.: A global averaging method for dynamic time warping, with applications to clustering. Pattern Recogn. 44(3), 678–693 (2011)CrossRefzbMATHGoogle Scholar
  10. 10.
    Lai, C.P., Chung, P.C., Tseng, V.S.: A novel two-level clustering method for time series data analysis. Expert Systems with Applications 37(9), 6319–6326 (2010)CrossRefGoogle Scholar
  11. 11.
    Guo, C., Li, H., Pan, D.: An improved piecewise aggregate approximation based on statistical features for time series mining. In: Bi, Y., Williams, M.-A. (eds.) KSEM 2010. LNCS, vol. 6291, pp. 234–244. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  12. 12.
    Li, H., Guo, C.: Piecewise cloud approximation for time series mining. Knowledge-Based Systems 24(4), 492–500 (2011)CrossRefGoogle Scholar
  13. 13.
    Vlachos, M., Gunopoulos, D., Kollios, G.: Discovering similar multidimensional trajectories. In: Proceedings of the 18th International Conference on Data Engineering, pp. 673–684 (2005)Google Scholar
  14. 14.
    Lin, J., Keogh, E., Lonardi, S., Chiu, B.: A symbolic representation of time series with implications for streaming algorithms. In: Proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 2–11 (2003)Google Scholar
  15. 15.
    Muscillo, R., Conforto, S., Schmid, S.: Classification of motor activities through derivative dynamic time warping applied on accelerometer aata. In: Proceedings of the 29th Annual International Conference of Engineering in Medicine and Biomedicine, pp. 4930–4933 (2007)Google Scholar
  16. 16.
    Itakura, F.: Minimum prediction residual principle applied to speech recognition. IEEE Transactions on Acoustous, Speech, and Signal Process 23(1), 52–72 (1975)Google Scholar
  17. 17.
    Sakoe, H., Chiba, S.: Dynamic programming algorithm optimization for spoken word recognition. IEEE Transactions on Acoustous, Speech, and Signal Process 26(1), 43–49 (1978)CrossRefzbMATHGoogle Scholar
  18. 18.
    Keogh, E., Pazzani, M.: Scaling up dynamic time warping for datamining applications. In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 285–289 (2000)Google Scholar
  19. 19.
    Zhou, M., Wong, M.H.: A segment-wise time warping method for time scaling searching. Information Sciences 173(1), 227–254 (2005)CrossRefMathSciNetGoogle Scholar
  20. 20.
    Sakurai, Y., Yoshikawa, M., Faloutsos, C.: FTW: fast similarity search under the time warping distance. In: Proceedings of the 2005 Principles of Database Systems, pp. 326–337 (2005)Google Scholar
  21. 21.
    Salvador, S., Chan, P.: FastDTW: toward accurate dynamic time warping in linear time and space. Intelligence Data Analysis 11(5), 561–580 (2007)Google Scholar
  22. 22.
    Keogh, E., Xi, X., Li, W.: Welcome to the UCR time series classification/clustering (2007), http://www.cs.ucr.edu/~eamonn/time_series_data/
  23. 23.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Hailin Li
    • 1
  • Libin Yang
    • 1
  1. 1.College of Business AdministrationHuaqiao UniversityQuanzhouChina

Personalised recommendations