The problem of similarity search in time series database has attracted a lot of interest in the data mining field. DTW(Dynamic Time Warping) is a robust distance measure function for time series, which can handle time shifting and scaling. The main defect of DTW lies in its relatively high computational complexity of similarity search. In this paper, we develop a simple but efficient approximation technique for DTW to speed up the search process. Our method is based on a variation of the traditional histograms of the time series. This method can work with a time linear with the size of the database. In our experiment, we proved that the proposed technique is efficient and produces few false dismissals in most applications. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Gu, J., & Jin, X. (2006). A simple approximation for dynamic time warping search in large time series database. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4224 LNCS, pp. 841–848). Springer Verlag. https://doi.org/10.1007/11875581_101
Mendeley helps you to discover research relevant for your work.