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

时间序列相关空间的学习

Learning Correlation Space for Time Series

Massachusetts Institute of Technology(麻省理工学院);IBM Research(IBM研究院)

Han Qiu, Hoang Thanh Lam, Francesco Fusco, Mathieu Sinn

摘要:

本文提出了一种近似算法,用于时间序列数据的高效相关搜索。在我们的方法中,我们使用傅立叶变换和神经网络嵌入到一个低维的欧氏空间的时间序列。学习给定的空间,使得时间序列相关性可以从相应的嵌入向量之间的欧几里得距离有效地近似。因此,可以使用嵌入空间中的索引来进行相关时间序列的搜索,以进行有效的最近邻搜索。我们的理论分析表明,我们的方法的精度可以保证一定的规律性条件下。我们进一步在真实世界的数据集上进行实验,结果表明我们的方法确实优于基线解决方案。特别是,对于近似的相关性,我们的方法减少了一半的近似损失,在大多数测试情况下相比,基线解决方案。对于top- $k$最高相关搜索,该方法在查询时间与基线方法查询时间相近的情况下,将精度从5%提高到20%.

英文摘要:

We propose an approximation algorithm for efficient correlation search in time series data. In our method, we use Fourier transform and neural network to embed time series into a low-dimensional Euclidean space. The given space is learned such that time series correlation can be effectively approximated from Euclidean distance between corresponding embedded vectors. Therefore, search for correlated time series can be done using an index in the embedding space for efficient nearest neighbor search. Our theoretical analysis illustrates that our method's accuracy can be guaranteed under certain regularity conditions. We further conduct experiments on real-world datasets and the results show that our method indeed outperforms the baseline solution. In particular, for approximation of correlation, our method reduces the approximation loss by a half in most test cases compared to the baseline solution. For top-$k$ highest correlation search, our method improves the precision from 5\% to 20\% while the query time is similar to the baseline approach query time.

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

↑