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

用移动-分裂-合并度量计算时间序列的精确均值

On Computing Exact Means of Time Series Using the Move-Split-Merge Metric

Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger

摘要:

计算一组时间序列的精确均值是时间序列最近邻分类和聚类等应用中的关键任务。虽然时间序列有许多距离函数,但用于计算时间序列均值的最流行的距离函数是非度量动态时间规整(DTW)距离。最近的一种精确计算DTW均值的算法的运行时间为$\mathcal{O}(n^{2k+1}2^kk)$,其中$k$表示时间序列的数量,$n$表示它们的最大长度。在本文中,我们研究的平均值问题的移动-分裂-合并(MSM)度量,不仅提供了很高的实际精度的时间序列分类,但也进行的度量属性,使进一步多样化的应用程序的优势。本文的主要贡献是为时间序列的MSM均值问题提供了一个精确有效的算法。该算法的运行时间为$\mathcal{O}(n^{k+3}2^k k^3 )$,优于以前的DTW算法。实验比较的结果证实了我们的算法相比DTW平均竞争对手的运行时间的优越性。此外,我们引入了一个启发式,以提高运行时间显着,而不牺牲太多的准确性。

英文摘要:

Computing an accurate mean of a set of time series is a critical task in applications like nearest-neighbor classification and clustering of time series. While there are many distance functions for time series, the most popular distance function used for the computation of time series means is the non-metric dynamic time warping (DTW) distance. A recent algorithm for the exact computation of a DTW-Mean has a running time of $\mathcal{O}(n^{2k+1}2^kk)$, where $k$ denotes the number of time series and $n$ their maximum length. In this paper, we study the mean problem for the move-split-merge (MSM) metric that not only offers high practical accuracy for time series classification but also carries of the advantages of the metric properties that enable further diverse applications. The main contribution of this paper is an exact and efficient algorithm for the MSM-Mean problem of time series. The running time of our algorithm is $\mathcal{O}(n^{k+3}2^k k^3 )$, and thus better than the previous DTW-based algorithm. The results of an experimental comparison confirm the running time superiority of our algorithm in comparison to the DTW-Mean competitor. Moreover, we introduce a heuristic to improve the running time significantly without sacrificing much accuracy.

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

↑