arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1703.01141cs.LG
收藏

动态变形

Dynamic State Warping

University of Science and Technology of China(中国科学技术大学)

Zhichen Gong, Huanhuan Chen

摘要:

序列在许多领域中的普遍存在增强了序列学习的兴趣,其中一个基本问题是如何测量序列之间的距离。动态时间规整(DTW)通过非线性局部规整来对齐两个序列并返回距离值。DTW在视频、图像等应用中表现出优越的性能。然而,在DTW中,两个点的配对基本上是基于点到点的欧氏距离(ED),而不考虑序列的自相关性。因此,具有不同语义含义的点(例如,峰和谷)可以被匹配,只要它们的坐标值相似。因此,DTW对噪声敏感且难以解释。本文提出了一种高效灵活的序列比对算法--动态变形算法。DSW将每个时间点转换为潜在状态,从而赋予逐点自相关信息。通过使用状态序列来执行比对。因此,DSW能够产生比DTW更语义可解释的对齐。使用一个最近邻分类器,DSW显示出与ED(70/85胜)和DTW(74/85胜)相比在分类精度上的显著改善。我们还经验证明,DSW是更强大的,更好地扩展到长序列比ED和DTW。

英文摘要:

The ubiquity of sequences in many domains enhances significant recent interest in sequence learning, for which a basic problem is how to measure the distance between sequences. Dynamic time warping (DTW) aligns two sequences by nonlinear local warping and returns a distance value. DTW shows superior ability in many applications, e.g. video, image, etc. However, in DTW, two points are paired essentially based on point-to-point Euclidean distance (ED) without considering the autocorrelation of sequences. Thus, points with different semantic meanings, e.g. peaks and valleys, may be matched providing their coordinate values are similar. As a result, DTW is sensitive to noise and poorly interpretable. This paper proposes an efficient and flexible sequence alignment algorithm, dynamic state warping (DSW). DSW converts each time point into a latent state, which endows point-wise autocorrelation information. Alignment is performed by using the state sequences. Thus DSW is able to yield alignment that is semantically more interpretable than that of DTW. Using one nearest neighbor classifier, DSW shows significant improvement on classification accuracy in comparison to ED (70/85 wins) and DTW (74/85 wins). We also empirically demonstrate that DSW is more robust and scales better to long sequences than ED and DTW.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑