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

时间序列复杂不一致搜索的快速算法:HOT SAX Time

A fast algorithm for complex discord searches in time series: HOT SAX Time

Università degli studi di Milano-Bicocca(米兰比可卡大学)

Paolo Avogadro, Matteo Alessandro Dominoni

摘要:

时间序列分析正在迅速地向长期和复杂的任务发展。近年来,快速近似算法的不和谐搜索已被提出,以弥补不断增加的规模的时间序列。然而,更有趣的是找到快速精确的解决方案。在这项研究中,我们改进了HOT SAX利用两个主要的想法:热身过程,和序列之间的相似性在时间上接近。由此产生的算法,称为HOT SAX时间(HST),已验证与真实和合成的时间序列,并成功地与HOT SAX,RRA,SCAMP,和DADD相比。一个不和谐的搜索的复杂性已经评估了一个新的指标,每序列的成本(cps),它允许一个比较不同长度的时间序列上的搜索。数值证据表明,两个条件涉及在确定一个不和谐搜索的复杂性在一个非平凡的方式:不和谐的长度,和噪声/信号比。在复杂搜索的情况下,HST可以比HOT SAX快100倍以上,因此处于精确不一致搜索的最前沿。

英文摘要:

Time series analysis is quickly proceeding towards long and complex tasks. In recent years, fast approximate algorithms for discord search have been proposed in order to compensate for the increasing size of the time series. It is more interesting, however, to find quick exact solutions. In this research, we improved HOT SAX by exploiting two main ideas: the warm-up process, and the similarity between sequences close in time. The resulting algorithm, called HOT SAX Time (HST), has been validated with real and synthetic time series, and successfully compared with HOT SAX, RRA, SCAMP, and DADD. The complexity of a discord search has been evaluated with a new indicator, the cost per sequence (cps), which allows one to compare searches on time series of different lengths. Numerical evidence suggests that two conditions are involved in determining the complexity of a discord search in a non-trivial way: the length of the discords, and the noise/signal ratio. In the case of complex searches, HST can be more than 100 times faster than HOT SAX, thus being at the forefront of the exact discord search.

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

↑