Elastic Product Quantization for Time Series
Pieter Robberechts, Wannes Meert, Jesse Davis

TL;DR
This paper introduces an efficient method for time series similarity search that combines product quantization with a pre-alignment step, enabling fast and accurate comparisons even with large datasets.
Contribution
The paper proposes a novel elastic product quantization technique that improves time series similarity assessment by addressing local phase shifts with a pre-alignment step.
Findings
Significantly reduces memory and computation time for time series comparison.
Maintains high accuracy in nearest neighbor classification and clustering.
Outperforms existing methods in efficiency and effectiveness.
Abstract
Analyzing numerous or long time series is difficult in practice due to the high storage costs and computational requirements. Therefore, techniques have been proposed to generate compact similarity-preserving representations of time series, enabling real-time similarity search on large in-memory data collections. However, the existing techniques are not ideally suited for assessing similarity when sequences are locally out of phase. In this paper, we propose the use of product quantization for efficient similarity-based comparison of time series under time warping. The idea is to first compress the data by partitioning the time series into equal length sub-sequences which are represented by a short code. The distance between two time series can then be efficiently approximated by pre-computed elastic distances between their codes. The partitioning into sub-sequences forces unwanted…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTime Series Analysis and Forecasting
