k Nearest Neighbour classification techniques, where k = 1, coupled with Dynamic Time Warping (DTW) are the most effective and most frequently used approaches for time series classification. However, because of the quadratic complexity of DTW, research efforts have been directed at methods and techniques to make the DTW process more efficient. This paper presents a new approach to efficient DTW, the Sub-Sequence-Based DTW approach. Two variations are considered, fixed length sub-sequence segmentation and fixed number sub-sequence segmentation. The reported experiments indicate that the technique improvs efficiency, compared to standard DTW, without adversely affecting effectiveness.
CITATION STYLE
Alshehri, M., Coenen, F., & Dures, K. (2019). Effective Sub-Sequence-Based Dynamic Time Warping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11927 LNAI, pp. 293–305). Springer. https://doi.org/10.1007/978-3-030-34885-4_23
Mendeley helps you to discover research relevant for your work.