New tighter lower bounds for DTW improve NN-DTW classification efficiency.
problem Efficient nearest neighbor search for DTW distances in time series.
method Developed new lower bounds leveraging DTW constraints for tighter and faster pruning.
result New lower bounds provide better balance between computation time and tightness.