Learning optimal warping window size of DTW for time series classification

Qian Chen, Guyu Hu, Fang-lin Gu, Peng Xiang
{"title":"Learning optimal warping window size of DTW for time series classification","authors":"Qian Chen, Guyu Hu, Fang-lin Gu, Peng Xiang","doi":"10.1109/ISSPA.2012.6310488","DOIUrl":null,"url":null,"abstract":"The dynamic time warping (DTW) is a classic similarity measure which can handle the time warping issue in similarity computation of time series. And the DTW with constrained warping window is the most common and practical form of DTW. In this paper, the traditional learning method for optimal warping window of DTW is systematically analyzed. Then the time distance to measure the time deviation between two time series is introduced. Finally a new learning method for optimal warping window size based on DTW and time distance is proposed which can improve DTW classification accuracy with little additional computation. Experimental data show that the optimal DTW with best warping window get better classification accuracy when the new learning method is employed. Additionally, the classification accuracy is better than that of ERP and LCSS, and is close to that of TWED.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.2012.6310488","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

Abstract

The dynamic time warping (DTW) is a classic similarity measure which can handle the time warping issue in similarity computation of time series. And the DTW with constrained warping window is the most common and practical form of DTW. In this paper, the traditional learning method for optimal warping window of DTW is systematically analyzed. Then the time distance to measure the time deviation between two time series is introduced. Finally a new learning method for optimal warping window size based on DTW and time distance is proposed which can improve DTW classification accuracy with little additional computation. Experimental data show that the optimal DTW with best warping window get better classification accuracy when the new learning method is employed. Additionally, the classification accuracy is better than that of ERP and LCSS, and is close to that of TWED.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
学习时间序列分类DTW的最优翘曲窗大小
动态时间翘曲(DTW)是一种经典的相似性度量方法,可以处理时间序列相似性计算中的时间翘曲问题。而带约束翘曲窗口的DTW是最常见、最实用的DTW形式。本文系统地分析了DTW最优翘曲窗的传统学习方法。然后引入时间距离来度量两个时间序列之间的时间偏差。最后提出了一种基于DTW和时间距离的最优翘曲窗大小学习方法,该方法可以在较少的额外计算量下提高DTW分类精度。实验数据表明,当采用新的学习方法时,具有最佳翘曲窗口的最优DTW具有更好的分类精度。分类精度优于ERP和LCSS,接近TWED的分类精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Online mvbf adaptation under diffuse noise environments with mimo based noise pre-filtering Hierarchical scheme for Arabic text recognition Precoder selection and rank adaptation in MIMO-OFDM Head detection using Kinect camera and its application to fall detection Wavelength and code division multiplexing toward diffuse optical imaging
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1