Lower bound for DTW distance
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
lib
src
.gitattributes
.gitignore
README.md
runLbComputeTime.sh
runLbTime.sh
runParamsTest.sh
runPruneTimeRandomSampling.sh
runPruneTimeSortEuclidean.sh
runPruneTimeSortLbKeogh.sh
runTightness.sh

README.md

LbEnhanced

This is the source code for LbEnhanced, a new lower bound for the DTW distance

Running the code:

Running from terminal

  1. Classification Time and Pruning Power (Order training data with Euclidean Distance)
  • java -Xmx14g -Xms14g -cp $LIBDIR: experiments.PruneAndTimeSortEuclidean $PROJECTDIR $DATASETDIR $PROBLEM $RUNS $WIN $TOESTIMATEORNOT $LOWERBOUND $ENHANCEDPARAM
  1. Tightness of the lower bounds
  • java -Xmx14g -Xms14g -cp $LIBDIR: experiments.Tightness $PROJECTDIR $DATASETDIR $PROBLEM $WIN $LOWERBOUND $ENHANCEDPARAM

Running from Bash Script

  1. bash runPruneTimeSortEuclidean.sh
  2. bash runPruneTimeRandomSampling.sh
  3. bash runTightness.sh