IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Section Min-Hash Approximating Time Series Search based on Dynamic Time Warping
Ryota TOMODAHisashi KOGA
著者情報
ジャーナル フリー 早期公開

論文ID: 2024DAP0004

詳細
抄録

Dynamic Time Warping (DTW) is a well-known similarity measure between time series data. Although DTW can calculate the similarity between time series with different lengths, it is computationally expensive. Therefore, fast algorithms that approximate the DTW have been desired. SSH (Sketch, Shingle & Hash) is a representative hash-based approximation algorithm. It extracts a set of quantized subsequences from a given time series and finds similar time series by means of Min-Hash, a hash-based set similarity search. However, Min-Hash does not care about the location of set elements (i.e., quantized subsequences) in the time series, so that hash collisions have rather weak correlation with DTW. In this paper, to strengthen the correlation between hash collisions and DTW, we propose a new method termed Section Min-Hash that can couple the hash values with the positions of quantized subsequences. After quantizing subsequences in a time series based on Euclidean distance, Section Min-Hash explicitly specifies multiple sections within the time series and generates the hash values from all the sections.

著者関連情報
© 2025 The Institute of Electronics, Information and Communication Engineers
前の記事 次の記事
feedback
Top