SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 0811.3301 · 2008

Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

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.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("0811.3301")
get_code_for_paper("0811.3301")
have("0811.3301")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/0811.3301.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/0811.3301.svg)](https://syntology.ai/paper/0811.3301)

Connect an agent — have() is free.