Speeding up similarity search under dynamic time warping by pruning unpromising alignments
From MaRDI portal
Publication:1741398
Recommendations
- Fast and exact warping of time series using adaptive segmental approximations
- Boundary-based lower-bound functions for dynamic time warping and their indexing
- Similarity search for spatial trajectories using online lower bounding DTW and presorting strategies
- Fast exact dynamic time warping on run-length encoded time series
- Faster retrieval with a two-pass dynamic-time-warping lower bound
Cites work
Cited in
(9)- Fast and exact warping of time series using adaptive segmental approximations
- TS-CHIEF: a scalable and accurate forest algorithm for time series classification
- Adaptively constrained dynamic time warping for time series classification and clustering
- Early abandoning and pruning for elastic distances including dynamic time warping
- Fast exact dynamic time warping on run-length encoded time series
- Boundary-based lower-bound functions for dynamic time warping and their indexing
- Time series classification by Euclidean distance-based visibility graph
- Similarity search for spatial trajectories using online lower bounding DTW and presorting strategies
- Deep learning for time series classification: a review
This page was built for publication: Speeding up similarity search under dynamic time warping by pruning unpromising alignments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741398)