FastDTW is approximate and Generally Slower than the Algorithm it Approximates (Extended Abstract).
Renjie WuEamonn J. KeoghPublished in: ICDE (2021)
Keyphrases
- extended abstract
- dynamic programming
- worst case
- learning algorithm
- experimental evaluation
- optimization algorithm
- high accuracy
- computational cost
- theoretical analysis
- computational complexity
- k means
- cost function
- matching algorithm
- objective function
- exact solution
- input image
- times faster
- estimation algorithm
- single pass
- probabilistic model
- preprocessing
- optimal solution
- similarity measure
- image processing
- linear programming
- np hard
- segmentation algorithm
- search space
- clustering method
- classification algorithm
- support vector
- convex hull
- memory requirements
- improved algorithm
- multiscale