Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: 21, Pages: 1-7
Kumar Vasimalla1 *, Narasimham Challa2 and Manohar Naik S3
1 Research and Development Center, [email protected]
2 Department of CSE, VIIT Visakhapatnam, [email protected]
3 Department of Computer Science, [email protected]
*Author For Correspondence
Research and Development Center,
Email: [email protected]
Background/Objective: Dynamic Time Warping (DTW), a similarity measure works in O(N2 ) complexity. Cause of this it will be used for small datasets only. Methods/Statistical Analysis: In this work, we introduced Efficient DTW (EDTW), which works in linear time. It uses two level approaches. In the first level data reduction is performed, and in the second level warping distance and path are calculated. Findings: While calculating the values of distance matrix, values along the warping path only considered and calculated. For time series of length n, maximum n values of distance matrix are calculated. So it works in linear time. We applied this distance measure to UCR Time Series archive and calculated error rImprovements/Applications: ate of 1NN classification. Most of the cases it is matching, some cases it is better, and some other cases error rate is high.
Keywords: Dynamic Time Warping, Efficient DTW, 1NN Classification, Time Series Classification, UCR Time Series Data Sets
Subscribe now for latest articles and news.