跳到正文
arXiv cs.AI· Christos Panourgias, Qitong Wang, George Tzagkarakis, Themis Palpanas·· 4 小时前AI 评分42

WETW:学习配对特定的加权欧氏距离以加速 DTW 相似搜索

WETW: Learning Pair-Specific Weighted Euclidean Distances for Efficient DTW Search

AI 导读

一项 arXiv 研究提出 WETW(Weighted Euclidean Time Warping),通过小型对称网络为每对时间序列的固定长度嵌入逐维预测权重,使误差比同嵌入上最优静态距离减半。

正文 · 原文

View PDF HTML (experimental)

Abstract:Dynamic Time Warping (DTW) is the standard distance for similarity search over time series that are misaligned in time, but its cost is quadratic in the series length and lower bounds often prune few candidates, so search over large collections of long series is slow. Learned approximations embed the series to make comparisons cheap, yet compare every pair with the same fixed rule, usually the Euclidean distance, although DTW aligns each pair differently. We observe that, once a pair is aligned, DTW is a Euclidean distance over coordinates selected for that pair. Building on this view, we propose Weighted Euclidean Time Warping (WETW), a learned distance that adapts the comparison of fixed-length embeddings to each pair. A small symmetric network predicts one weight per embedding di- mension and pair without computing an alignment, which halves the error of the best static distance on the same embeddings. The embeddings come from the Weighted Euclidean SEries Encoder (WESEE), whose multi-scale Temporal Feature Extractor keeps the timing information that global pooling removes and raises recall@1 from 0.90 to 0.95, although WETW works with any encoder. We also show that fitting DTW distances is not enough for search, as regression alone misorders the closest neighbours, and that ranking regularization raises recall@1 from 0.79 to 0.95. Our filter-and-verify pipeline, WETW-FV, uses WETW to build a shortlist and exact DTW to check it, so the search is approximate but every returned distance is exact. Over eight datasets, WETW-FV is 11.4x faster than the fastest exact method among the UCR Suite, lower bounds and MESSI-DTW, at a mean recall@10 of 0.93, while the best learned baseline reaches 0.59 at the same speed. On 48K-point series, WETW- FV remains 40x faster than the UCR Suite at a recall@10 of 0.91.
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
Cite as: arXiv:2611.17412 [cs.LG]
  (or arXiv:2611.17412v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2611.17412

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Christos Panourgias [view email]
[v1] Thu, 12 Nov 2026 19:00:03 UTC (1,981 KB)

来源:arXiv cs.AI · arxiv.org