A Fast-Optimal Guaranteed Algorithm For Learning Sub-Interval Relationships in Time Series
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.
- Date of publication:
- June 3, 2019
- Cornell University
- Publication note:
Saurabh Agrawal, Saurabh Verma, Anuj Karpatne, Stefan Liess, Snigdhansu Chatterjee, Vipin Kumar: A Fast-Optimal Guaranteed Algorithm For Learning Sub-Interval Relationships in Time Series. CoRR abs/1906.01450 (2019)