FastDTW is Approximate and Generally Slower Than the Algorithm it Approximates

Renjie Wu 0001, Eamonn J. Keogh. FastDTW is Approximate and Generally Slower Than the Algorithm it Approximates. IEEE Trans. Knowl. Data Eng., 34(8):3779-3785, 2022. [doi]

@article{WuK22-0,
  title = {FastDTW is Approximate and Generally Slower Than the Algorithm it Approximates},
  author = {Renjie Wu 0001 and Eamonn J. Keogh},
  year = {2022},
  doi = {10.1109/TKDE.2020.3033752},
  url = {https://doi.org/10.1109/TKDE.2020.3033752},
  researchr = {https://researchr.org/publication/WuK22-0},
  cites = {0},
  citedby = {0},
  journal = {IEEE Trans. Knowl. Data Eng.},
  volume = {34},
  number = {8},
  pages = {3779-3785},
}