Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound
The Dynamic Time Warping (DTW) is a popular similarity measure between time series. The DTW fails to satisfy the triangle inequality and its computation requires quadratic time. Hence, to find closest neighbors quickly, we use bounding techniques. We can avoid most DTW computations with an inexpensive lower bound (LB Keogh). We compare LB Keogh with a tighter lower bound (LB Improved). We find that LB Improved-based search is faster. As an example, our approach is 2-3 times faster over random-walk and shape time series.
Code (1)
Tasks
Dynamic Time WarpingRetrievalTime SeriesTime Series AnalysisVocal Bursts Valence PredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Fast dynamic time warping and clustering in C++
We present an approach for computationally efficient dynamic time warping (DTW) and clustering of time-series data. The method frames the dynamic warping of time series datasets as an optimisation problem solved using dy…
ClusteringDynamic Time WarpingTime SeriesDTW-Align: Bridging the Modality Gap in End-to-End Speech Translation with Dynamic Time Warping Alignment
End-to-End Speech Translation (E2E-ST) is the task of translating source speech directly into target text bypassing the intermediate transcription step. The representation discrepancy between the speech and text modaliti…
Variable Sampling MPC via Differentiable Time-Warping Function
Designing control inputs for a system that involves dynamical responses in multiple timescales is nontrivial. This paper proposes a parameterized time-warping function to enable a non-uniformly sampling along a predictio…
Time-Warping Recurrent Neural Networks for Transfer Learning
Dynamical systems describe how a physical system evolves over time. Physical processes can evolve faster or slower in different environmental conditions. We use time-warping as rescaling the time in a model of a physical…
Transfer LearningDynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
The paper presents a novel method of finding a fragment in a long temporal sequence similar to the set of shorter sequences. We are the first to propose an algorithm for such a search that does not rely on computing the …
Dynamic Time WarpingRetrievalSemantic Retrieval