基于不同距离函数的高效矩阵轮廓计算
Efficient Matrix Profile Computation Using Different Distance Functions
摘要:
矩阵轮廓是最近提出的一种很有前途的技术,时间序列的所有对相似性搜索的问题。已经提出了用于计算它的有效算法,例如,STAMP、STOMP和SCRIMP++。所有这些算法都使用z-归一化欧几里德距离来度量连续性之间的距离。然而,正如我们所观察到的,对于某些数据集,其他欧几里得度量对于从时间序列中发现知识更有用。在本文中,我们提出了有效的算法计算矩阵轮廓的一般类的欧氏距离。首先,我们提出了一个简单而有效的算法称为AAMP计算矩阵配置文件的“纯”(非归一化)的欧氏距离。然后,我们扩展我们的算法的p-范数距离。我们还提出了一种算法,称为ACAMP,它使用相同的原则作为AAMP,但对于z-归一化的欧几里得距离的情况。我们实现了我们的算法,并通过实验评估其性能。实验结果表明,该算法具有良好的性能。例如,他们表明AAMP对于计算非归一化欧几里得距离的矩阵轮廓非常有效。结果还表明,ACAMP算法是显着快于SCRIMP++(最先进的矩阵轮廓算法的状态)的情况下,z归一化的欧几里德距离。
英文摘要:
Matrix profile has been recently proposed as a promising technique to the problem of all-pairs-similarity search on time series. Efficient algorithms have been proposed for computing it, e.g., STAMP, STOMP and SCRIMP++. All these algorithms use the z-normalized Euclidean distance to measure the distance between subsequences. However, as we observed, for some datasets other Euclidean measurements are more useful for knowledge discovery from time series. In this paper, we propose efficient algorithms for computing matrix profile for a general class of Euclidean distances. We first propose a simple but efficient algorithm called AAMP for computing matrix profile with the "pure" (non-normalized) Euclidean distance. Then, we extend our algorithm for the p-norm distance. We also propose an algorithm, called ACAMP, that uses the same principle as AAMP, but for the case of z-normalized Euclidean distance. We implemented our algorithms, and evaluated their performance through experimentation. The experiments show excellent performance results. For example, they show that AAMP is very efficient for computing matrix profile for non-normalized Euclidean distances. The results also show that the ACAMP algorithm is significantly faster than SCRIMP++ (the state of the art matrix profile algorithm) for the case of z-normalized Euclidean distance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。