An OGS-Based Dynamic Time Warping Algorithm for Time Series Data

Mi Zhou ()
Additional contact information
Mi Zhou: Jinan University

A chapter in Innovation in the High-Tech Economy, 2013, pp 115-121 from Springer

Abstract: 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.

Keywords: Dynamic Time Warping; Ordered Graph Search; Time Series; Lower Bound (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:conchp:978-3-642-41585-2_10

Ordering information: This item can be ordered from
http://www.springer.com/9783642415852

DOI: 10.1007/978-3-642-41585-2_10

Access Statistics for this chapter

More chapters in Contributions to Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().