Title page for etd-0631118-170443


[Back to Results | New Search]

URN etd-0631118-170443
Author Bo-Xian Chen
Author's Email Address abc2344666@gmail.com
Statistics This thesis had been viewed 5350 times. Download 4 times.
Department Computer Science and Engineering
Year 2017
Semester 2
Degree Master
Type of Document
Language English
Title A Fast Algorithm for Dynamic Time Warping with Adaptive Window
Date of Defense 2018-07-30
Page Count 62
Keyword
  • distance measurement
  • time series classi cation (TSC) problem
  • dynamic time warping (DTW)
  • derivative dynamic time warping (DDTW)
  • warping window
  • Abstract The classification problem is a critical issue in data processing field, especially emph{time series classification} (TSC) problem. In the TSC problem, the calculation of the distance of two time series is the kernel issue.
    One of the famous methods for the distance calculation is the emph{dynamic time warping} (DTW), based on the dynamic programming. However, the time complexity of DTW is $O(n^2)$. When the data size is large, it takes too much time to calculate. In order to overcome time consuming problem, emph{dynamic time warping with window} (DTWW) combines the warping window into DTW calculation. This method reduces the computation time by restricting the number of possible solutions, so the answer of DTWW may not be the optimal solution. In this thesis, we present a method that expands the possible solutions in the minimum first order. Our method not only reduces the required computation time, but also gets the optimal answer.
    Advisory Committee
  • Chien-Feng Huang - chair
  • Kuo-Tsung Tseng - co-chair
  • Shih-Chung Chen - co-chair
  • Chang-Biau Yang - advisor
  • Files
  • etd-0631118-170443.pdf
  • Indicate in-campus at 0 year and off-campus access at 1 year.
    Date of Submission 2018-07-31

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys