Boundary-based lower-bound functions for dynamic time warping and their indexing
From MaRDI portal
(Redirected from Publication:433073)
Recommendations
- Faster retrieval with a two-pass dynamic-time-warping lower bound
- Fast and exact warping of time series using adaptive segmental approximations
- Similarity search for spatial trajectories using online lower bounding DTW and presorting strategies
- Speeding up similarity search under dynamic time warping by pruning unpromising alignments
- Distance measure with improved lower bound for multivariate time series
Cites work
- Dimensionality reduction for fast similarity search in large time series databases
- Dynamic programming algorithm optimization for spoken word recognition
- Performance tradeoffs in dynamic time warping algorithms for isolated word recognition
- Similar sequence matching supporting variable-length and variable-tolerance continuous queries on time-series data stream
- Subspace projection: A unified framework for a class of partition-based dimension reduction techniques
- Using multiple indexes for efficient subsequence matching in time-series databases
Cited in
(6)- Wavelet-based dynamic time warping
- Speeding up similarity search under dynamic time warping by pruning unpromising alignments
- Fast and exact warping of time series using adaptive segmental approximations
- Similarity search for spatial trajectories using online lower bounding DTW and presorting strategies
- Faster retrieval with a two-pass dynamic-time-warping lower bound
- Distance measure with improved lower bound for multivariate time series
This page was built for publication: Boundary-based lower-bound functions for dynamic time warping and their indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433073)