Abstract
Dynamic Time Warping (DTW) is a powerful technique in the time-series similarity search. However, its performance on large-scale data is unsatisfactory because of its high computational cost. Although many methods have been proposed to alleviate this, they are mostly in- direct methods, i.e., they do not improve the DTW algorithm itself. In this paper, we propose to incorporate the Ordered Graph Search (OGS) and the lower bound for DTW into an improved DTW algorithm and apply it on time series data. Extensive experiments show that the improved DTW algorithm is faster than the original dynamic programming based algorithm on multi-dimensional time series data. It is also especially useful in the post-processing stage of searching in large time series data based on DTW distance.
Supported by National Natural Science Foundation of China (Grant No. 61202108).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Brown M, Rabiner L (1982) An adaptive, ordered, graph search technique for dynamic time warping for isolated word recognition. IEEE Trans Acoust Speech Signal Process 30(4):535–544
Keogh E (2002) Exact indexing of dynamic time warping. In: VLDB 2002, pp 406–417
Keogh EJ, Pazzani MJ (2001) Derivative dynamic time warping. In: First SIAM international conference on Data Mining (SDM’2001). Chicago, IL, USA
Lei HS, Sun BY (2007) A study on the dynamic time warping in kernel machines. In: Proceedings of the third international IEEE conference on Signal-Image Technologies and Internet-Based System SITIS’07. Shanghai, China, 16–18 Dec 2007, pp 839–845
Rabiner L, Juang BH (1993) Fundamentals of speech recognition. Prentice Hall, Englewood Cliffs
Sakoe H, Chiba S (1978) Dynamic programming algorithm optimization for spoken word recognition. In: IEEE transactions on acoustics, speech and signal processing, ASSP-26(1), pp 43–49
Zhou M, Wong MH (2005) A segment-wise time warping method for time scaling searching. Inf Sci 173(1–3):227–254
Zhou M, Wong MH (2011) Boundary-based lower-bound functions for dynamic time warping and their indexing. Inf Sci 181(19):4175–4196
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Zhou, M. (2013). An OGS-Based Dynamic Time Warping Algorithm for Time Series Data. In: Chuan, P., Khachidze, V., Lai, I., Liu, Y., Siddiqui, S., Wang, T. (eds) Innovation in the High-Tech Economy. Contributions to Economics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41585-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-41585-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41584-5
Online ISBN: 978-3-642-41585-2
eBook Packages: Business and EconomicsBusiness and Management (R0)