Journal
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
Volume 6, Issue 1, Pages 145-153Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s13042-014-0254-0
Keywords
Dynamic time warping; Similarity measure; Time series data mining; Online measurement
Categories
Funding
- National Natural Science Foundation of China [61300139]
- Society and Science Planning Projects of Fujian [2013C018]
- Fundamental Research Funds for the Central Universities [12SKGCQG03]
Ask authors/readers for more resources
Dynamic time warping (DTW) is a robust method used to measure similarity of time series. To speed up the calculation of DTW, an on-line and dynamic time warping is proposed to the field of time series data mining. A sliding window is used to segment a long time series into several short subsequences, and an efficient DTW proposed to measure the similarity of each pair of short subsequences. Meanwhile, a forward factor is proposed to set an overlap warping path for the two adjacent subsequences, which makes the last warping path be close to the best warping path between two time series. The results of numerical experiments demonstrate that, in contrast to DTW, the proposed approach comparing to DTW measures the similarity of time series fast and validly, which improves the performance of the algorithm applied to the field of time series data mining.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available