FastDTW is Approximate and Generally Slower Than the Algorithm it Approximates.
Renjie WuEamonn J. KeoghPublished in: IEEE Trans. Knowl. Data Eng. (2022)
Keyphrases
- improved algorithm
- learning algorithm
- preprocessing
- times faster
- experimental evaluation
- optimization algorithm
- computational cost
- search space
- high accuracy
- dynamic programming
- single pass
- experimental study
- theoretical analysis
- expectation maximization
- computational complexity
- optimal solution
- objective function
- cost function
- data sets
- linear programming
- segmentation algorithm
- detection algorithm
- tree structure
- matching algorithm
- neural network
- bayesian networks
- exact solution
- estimation algorithm
- hardware implementation
- image segmentation
- ant colony optimization
- k means
- least squares