论文标题
用于子序列匹配的动态边界时间扭曲，几乎没有例子
Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
论文作者
论文摘要
本文提出了一种新的方法，可以在长时间的时间序列中找到片段，类似于较短序列。我们是第一个为这种搜索提出算法的人，该算法不依赖于从查询示例中计算平均序列。相反，我们同时使用所有查询示例。基于动态时间翘曲（DTW）技术的引入方法明确适用于示例检索任务的几次查询。我们在自然语言处理领域的两个不同的少数问题上对其进行了评估。结果表明，当示例数量少时，它要么优于基准和以前的方法，要么可以实现可比的结果。
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.
