Speeding up similarity search under dynamic time warping by pruning unpromising alignments
Speeding up similarity search under dynamic time warping by pruning unpromising alignments
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
Similarity search is the core procedure for several time series mining tasks. While different distance measures can be used for this purpose, there is clear evidence that the Dynamic Time Warping (DTW) is the most suitable distance function for a wide range of application domains. Despite its quadratic complexity, research efforts have proposed a s...
Alternative Titles
Full title
Speeding up similarity search under dynamic time warping by pruning unpromising alignments
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2015537686
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2015537686
Other Identifiers
ISSN
1384-5810
E-ISSN
1573-756X
DOI
10.1007/s10618-018-0557-y
