🧪 Test?View on arXiv
WETW: Learning Pair-Specific Weighted Euclidean Distances for Efficient DTW Search
Not provided in the abstract
time seriesdynamic time warpingmachine learningdistance metrics
2611.17412
Builder Relevance
19h ago80%
Abstract
The paper presents a new method, Weighted Euclidean Time Warping (WETW), which improves the efficiency of Dynamic Time Warping (DTW) search by learning pair-specific weights for Euclidean distances.
Reality Card
Core Claim
WETW-FV is 11.4x faster than the fastest exact DTW method while achieving a mean recall@10 of 0.93.
Method / Result
WETW-FV achieves a recall@10 of 0.93 while being 11.4x faster than the fastest exact method.
Limitations
The paper does not provide specific details on the implementation or datasets used for training the model, which may affect reproducibility.
Paper to code
Verified implementation resources so builders can test the paper’s claims instead of stopping at the abstract.
No verified implementation link has been attached yet. AIBuzzHub will keep this panel separate from unverified search results.