Pages that link to "Item:Q1741398"
From MaRDI portal
The following pages link to Speeding up similarity search under dynamic time warping by pruning unpromising alignments (Q1741398):
Displaying 9 items.
- Deep learning for time series classification: a review (Q69113) (← links)
- Boundary-based lower-bound functions for dynamic time warping and their indexing (Q433073) (← links)
- Fast and exact warping of time series using adaptive segmental approximations (Q1774589) (← links)
- TS-CHIEF: a scalable and accurate forest algorithm for time series classification (Q1987186) (← links)
- Adaptively constrained dynamic time warping for time series classification and clustering (Q2023198) (← links)
- Early abandoning and pruning for elastic distances including dynamic time warping (Q2066658) (← links)
- Fast exact dynamic time warping on run-length encoded time series (Q2684485) (← links)
- Time series classification by Euclidean distance-based visibility graph (Q6167713) (← links)
- Similarity search for spatial trajectories using online lower bounding DTW and presorting strategies (Q6487468) (← links)
