WETW: Learning Pair-Specific Weighted Euclidean Distances for Efficient DTW Search
Summary
This work learns pair-specific weighted distances for dynamic time warping search, avoiding quadratic cost and speeding up time series similarity search.
Why this matters
Relevant to this topic
Source: arXiv cs.AI · arxiv.org