Tight lower bounds for dynamic time warping

作者：

Highlights：

• Four novel and effective lower bounds for Dynamic Time Warping that have linear complexity.

• Provide substantial speed-up for nearest neighbor time series search.

• Useful under a wide variety of different types of nearest neighbour search.

摘要

•Four novel and effective lower bounds for Dynamic Time Warping that have linear complexity.•Provide substantial speed-up for nearest neighbor time series search.•Useful under a wide variety of different types of nearest neighbour search.

论文关键词：Dynamic time warping,Lower bound,Time series

论文评审过程：Received 8 October 2019, Revised 4 February 2021, Accepted 11 February 2021, Available online 16 February 2021, Version of Record 1 March 2021.

论文官网地址：https://doi.org/10.1016/j.patcog.2021.107895