Speeding up similarity search under dynamic time warping by pruning unpromising alignments
From MaRDI portal
Publication:1741398
DOI10.1007/s10618-018-0557-yzbMath1416.62528OpenAlexW2792071264WikidataQ59415744 ScholiaQ59415744MaRDI QIDQ1741398
Diego Furtado Silva, Gustavo E. A. P. A. Batista, Rafael Giusti, Eamonn J. Keogh
Publication date: 3 May 2019
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-018-0557-y
Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Data structures (68P05)
Related Items
Fast exact dynamic time warping on run-length encoded time series, Time series classification by Euclidean distance-based visibility graph, TS-CHIEF: a scalable and accurate forest algorithm for time series classification, Deep learning for time series classification: a review, Adaptively constrained dynamic time warping for time series classification and clustering, Early abandoning and pruning for elastic distances including dynamic time warping
Uses Software
Cites Work