Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples

27 Oct 2020  ·  Łukasz Borchmann, Dawid Jurkiewicz, Filip Graliński, Tomasz Górecki ·

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 average sequence from query examples. Instead, we use query examples as is, utilizing all of them simultaneously. The introduced method based on the Dynamic Time Warping (DTW) technique is suited explicitly for few-shot query-by-example retrieval tasks. We evaluate it on two different few-shot problems from the field of Natural Language Processing. The results show it either outperforms baselines and previous approaches or achieves comparable results when a low number of examples is available.

PDF Abstract


Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Semantic Retrieval Contract Discovery DBTW, GPT-1 embeddings, fICA Soft-F1 0.51 # 2


No methods listed for this paper. Add relevant methods here