Faster retrieval with a two-pass dynamic-time-warping lower bound

DOI10.1016/j.patcog.2008.11.030zbMath1169.68594OpenAlexW1974339580WikidataQ56228138 ScholiaQ56228138MaRDI QIDQ2270858

Daniel Lemire

Publication date: 29 July 2009

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: http://r-libre.teluq.ca/225/1/0811.3301v2.pdf

zbMATH Keywords

classificationtime seriesindexingvery large databases

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Information storage and retrieval of data (68P20)

Related Items

Distance measure with improved lower bound for multivariate time series ⋮ Approximating length-restricted means under dynamic time warping ⋮ Approximate nearest neighbor for curves: simple, efficient, and deterministic ⋮ FastEE: fast ensembles of elastic distances for time series classification ⋮ Time series classification by class-specific Mahalanobis distance measures ⋮ Early abandoning and pruning for elastic distances including dynamic time warping ⋮ First and Second Derivatives in Time Series Classification Using DTW

Cites Work

• Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
• On-line signature recognition based on VQ-DTW
• An energy-based similarity measure for time series
• Fast and exact warping of time series using adaptive segmental approximations
• Efficient many-to-Many point matching in one dimension
• Dynamic programming algorithm optimization for spoken word recognition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item