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

时间序列子区间关系学习的快速最优保证算法

A Fast-Optimal Guaranteed Algorithm For Learning Sub-Interval Relationships in Time Series

University of Minnesota(明尼苏达大学)

Saurabh Agrawal, Saurabh Verma, Anuj Karpatne, Stefan Liess, Snigdhansu Chatterjee, Vipin Kumar

摘要:

传统的方法主要关注于发现两个完整时间序列之间的关系,然而,许多有趣的关系存在于时间的小的子区间,并在其他子区间保持微弱。我们定义了一个子区间关系(SIR)的概念,以捕捉这样的相互作用,突出只有在某些子区间的时间。为此,我们提出了一个快速最优保证算法,以找到最有趣的SIR关系在一对时间序列。最后,我们展示了我们的方法在气候科学领域的实用性,基于现实世界的数据集及其可扩展性范围,并获得有用的领域见解。

英文摘要:

Traditional approaches focus on finding relationships between two entire time series, however, many interesting relationships exist in small sub-intervals of time and remain feeble during other sub-intervals. We define the notion of a sub-interval relationship (SIR) to capture such interactions that are prominent only in certain sub-intervals of time. To that end, we propose a fast-optimal guaranteed algorithm to find most interesting SIR relationship in a pair of time series. Lastly, we demonstrate the utility of our method in climate science domain based on a real-world dataset along with its scalability scope and obtain useful domain insights.

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

↑