Flexible Dynamic Time Warping for Time Series Classification

被引:23
作者
Hsu, Che-Jui [1 ]
Huang, Kuo-Si [2 ]
Yang, Chang-Biau [1 ]
Guo, Yi-Pu [1 ]
机构
[1] Natl Sun Yat Sen Univ, Dept Comp Sci & Engn, Kaohsiung 80424, Taiwan
[2] Natl Kaohsiung Marine Univ, Dept Informat Management, Kaohsiung, Taiwan
来源
INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2015 COMPUTATIONAL SCIENCE AT THE GATES OF NATURE | 2015年 / 51卷
关键词
dynamic time warping; time series; classification; longest common subsequence; EFFICIENT ALGORITHMS;
D O I
10.1016/j.procs.2015.05.444
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Measuring the similarity or distance between two time series sequences is critical for the classification of a set of time series sequences. Given two time series sequences, X and Y, the dynamic time warping (DTW) algorithm can calculate the distance between X and Y. But the DTW algorithm may align some neighboring points in X to the corresponding points which are far apart in Y. It may get the alignment with higher score, but with less representative information. This paper proposes the flexible dynamic time wrapping (FDTW) method for measuring the similarity of two time series sequences. The FDTW algorithm adds an additional score as the reward for the contiguously long one-to-one fragment. As the experimental results show, the DTW and DDTW and FDTW methods outperforms each other in some testing sets. By combining the FDTW, DTW and DDTW methods to form a classifier ensemble with the voting scheme, it has less average error rate than that of each individual method.
引用
收藏
页码:2838 / 2842
页数:5
相关论文
共 12 条
  • [1] Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
    Ann, Hsing-Yen
    Yang, Chang-Biau
    Tseng, Chiou-Ting
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (04) : 800 - 813
  • [2] [Anonymous], 2001, P 1 SIAM INT C DAT M
  • [3] Using derivatives in a longest common subsequence dissimilarity measure for time series classification
    Gorecki, Tomasz
    [J]. PATTERN RECOGNITION LETTERS, 2014, 45 : 99 - 105
  • [4] Guo Y., 2014, Transportation Electrification Conference and Expo (ITEC), 2014 IEEE, P1, DOI [10.1109/Agro-Geoinformatics.2014.6910678, DOI 10.1109/PESGM.2014.6938798]
  • [5] Nonlinear alignment and averaging for estimating the evoked potential
    Gupta, L
    Molfese, DL
    Tammana, R
    Simos, PG
    [J]. IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 1996, 43 (04) : 348 - 356
  • [6] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES
    HIRSCHBERG, DS
    [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (06) : 341 - 343
  • [7] Efficient algorithms for finding interleaving relationship between sequences
    Huang, Kuo-Si
    Yang, Chang-Biau
    Tseng, Kuo-Tsung
    Ann, Hsing-Yen
    Peng, Yung-Hsing
    [J]. INFORMATION PROCESSING LETTERS, 2008, 105 (05) : 188 - 193
  • [8] Weighted dynamic time warping for time series classification
    Jeong, Young-Seon
    Jeong, Myong K.
    Omitaomu, Olufemi A.
    [J]. PATTERN RECOGNITION, 2011, 44 (09) : 2231 - 2240
  • [9] On the need for time series data mining benchmarks: A survey and empirical demonstration
    Keogh, E
    Kasetty, S
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2003, 7 (04) : 349 - 371
  • [10] Keogh E., 2011, UCR TIME SERIES CLAS