FastDTW is approximate and Generally Slower than the Algorithm it Approximates.
Renjie WuEamonn J. KeoghPublished in: CoRR (2020)
Keyphrases
- times faster
- expectation maximization
- learning algorithm
- high accuracy
- experimental evaluation
- significant improvement
- theoretical analysis
- improved algorithm
- matching algorithm
- objective function
- computational cost
- dynamic programming
- optimization algorithm
- detection algorithm
- clustering method
- selection algorithm
- cost function
- video sequences
- worst case
- optimal solution
- particle swarm optimization
- k means
- segmentation algorithm
- monte carlo
- np hard
- data sets