Boundary-based lower-bound functions for dynamic time warping and their indexing
From MaRDI portal
Publication:433073
DOI10.1016/J.INS.2011.04.048zbMATH Open1242.68263OpenAlexW2059203360MaRDI QIDQ433073FDOQ433073
Authors: Mi Zhou, Man Hon Wong 
Publication date: 13 July 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2011.04.048
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
Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Dynamic programming algorithm optimization for spoken word recognition
- Dimensionality reduction for fast similarity search in large time series databases
- 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
- Similar sequence matching supporting variable-length and variable-tolerance continuous queries on time-series data stream
- Performance tradeoffs in dynamic time warping algorithms for isolated word recognition
Cited In (4)
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)
