A fast algorithm for complex discord searches in time series: HOT SAX Time
Paolo Avogadro, Matteo Alessandro Dominoni

TL;DR
This paper introduces HOT SAX Time (HST), an improved exact algorithm for discord search in time series, significantly faster than previous methods by leveraging sequence similarity and warm-up techniques.
Contribution
The paper presents HST, a novel exact discord search algorithm that outperforms HOT SAX and others, with a new complexity indicator and validation on real and synthetic data.
Findings
HST can be over 100 times faster than HOT SAX.
The complexity depends on discord length and noise/signal ratio.
HST effectively balances speed and accuracy in discord detection.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTime Series Analysis and Forecasting · Complex Systems and Time Series Analysis · Stock Market Forecasting Methods
