leSAX Index: A Learned SAX Representation Index for Time Series Similarity Search

Time series similarity search (TSSS) is a fundamental task across various applications, including classification, motif discovery, and anomaly detection. However, existing iSAXbased index methods, while known for their efficiency, often rely on hand-crafted techniques (e.g., PAA and SAX) for znormalized time series data. However, these techniques do not fully exploit the full representation space and pose challenges to indexing. In this paper, we propose a learned index approach for TSSS. Specifically, we introduce SAXNET, a novel twostage neural network that generates the learned SAX representation (LESAX representation) for both z-normalized and nonz- normalized time series data. The benefits of SAXNET are threefold: 1 full exploitation of latent space, 2 preservation of time series shapes and global information for indexing, and 3 elimination of the need for hand-crafted techniques. We then propose LESAX index, a novel learned SAX representation index, which consists of a LESAX tree and a learned index. The distribution of the LESAX representations in the LESAX tree is adjusted to achieve a near-uniform distribution for index efficiency. Furthermore, we propose a learned index structure that works alongside the LESAX tree, applied recursively in case of large index leaf nodes. We have conducted comprehensive experiments on exact similarity search using our SAXNET and LESAX index on both real and synthetic time series datasets. The results demonstrate that our LESAX method outperforms state-of-the-art methods in efficiency, achieving performance improvements ranging from 3.6× to 17×.