论文标题
时间序列的分段成对距离,不连续
Segmented Pairwise Distance for Time Series with Large Discontinuities
论文作者
论文摘要
在许多情况下,有较大不连续性的时间序列很常见。但是,现有的基于距离的算法(例如,DTW及其导数算法)在测量这些时间序列对之间的距离方面的性能很差。在本文中,我们提出了分段的成对距离(SPD)算法,以测量具有较大不连续性的时间序列之间的距离。 SPD与基于距离的算法是正交的,可以嵌入其中。我们验证了与开放数据集和外科时间序列的专有数据集(外科医生在虚拟现实手术模拟器中进行颞骨外科手术的外科医生)相对于相应距离的算法的优势。实验结果表明,在时间序列之间,由SILHOUETTE指数(SI)衡量的时间序列之间的距离测量值(SI)在时间序列之间的距离测量中优于基于相应的距离算法。
Time series with large discontinuities are common in many scenarios. However, existing distance-based algorithms (e.g., DTW and its derivative algorithms) may perform poorly in measuring distances between these time series pairs. In this paper, we propose the segmented pairwise distance (SPD) algorithm to measure distances between time series with large discontinuities. SPD is orthogonal to distance-based algorithms and can be embedded in them. We validate advantages of SPD-embedded algorithms over corresponding distance-based ones on both open datasets and a proprietary dataset of surgical time series (of surgeons performing a temporal bone surgery in a virtual reality surgery simulator). Experimental results demonstrate that SPD-embedded algorithms outperform corresponding distance-based ones in distance measurement between time series with large discontinuities, measured by the Silhouette index (SI).