TC-DTW: Accelerating Multivariate Dynamic Time Warping Through Triangle Inequality and Point Clustering
원문 초록
Dynamic time warping (DTW) plays an important role in analytics on time series. Despite the large body of research on speeding up univariate DTW, the method for multivariate DTW has not been improved much in the last two decades. The most popular algorithm used today is still the one developed seventeen years ago. This paper presents a solution that, as far as we know, for the first time consistently outperforms the classic multivariate DTW algorithm across dataset sizes, series lengths, data dimensions, temporal window sizes, and machines. The new solution, named TC-DTW, introduces Triangle Inequality and Point Clustering into the algorithm design on lower bound calculations for multivariate DTW. In experiments on DTW-based nearest neighbor finding, the new solution avoids as much as 98% (60% average) DTW distance calculations and yields as much as 25X (7.5X average) speedups.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
TimePoint: Accelerated Time Series Alignment via Self-Supervised Keypoint and Descriptor Learning
Support Vector Machines with Time Series Distance Kernels for Action Classification
A Review of the Long Horizon Forecasting Problem in Time Series Analysis
The interplay of robustness and generalization in quantum machine learning
A Better Alternative to Piecewise Linear Time Series Segmentation
From Images to Signals: Are Large Vision Models Useful for Time Series Analysis?
토론
이 논문과 연결된 포럼 글이 아직 없습니다.