Efficient Retrieval of Similar Time Sequences Using DFT
arXiv:cs/9809033
Abstract
We propose an improvement of the known DFT-based indexing technique for fast retrieval of similar time sequences. We use the last few Fourier coefficients in the distance computation without storing them in the index since every coefficient at the end is the complex conjugate of a coefficient at the beginning and as strong as its counterpart. We show analytically that this observation can accelerate the search time of the index by more than a factor of two. This result was confirmed by our experiments, which were carried out on real stock prices and synthetic data.
Cited by in corpus (4)
- Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search
- The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art
- Scalable Data Series Subsequence Matching with ULISSE
- Matrix Profile Goes MAD: Variable-Length Motif And Discord Discovery in Data Series