计算机科学 ›› 2013, Vol. 40 ›› Issue (4): 227-230.

• 人工智能 • 上一篇    下一篇

基于增量动态时间弯曲的时间序列相似性度量方法

李海林,杨丽彬   

  1. 华侨大学工商管理学院泉州362021;华侨大学工商管理学院泉州362021
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受中央高校基本科研业务费(12SKGC-QG03),江西省自然科学基金项目(20122BABA201044)资助

Similarity Measure for Time Series Based on Incremental Dynamic Time Warping

LI Hai-lin and YANG Li-bin   

  • Online:2018-11-16 Published:2018-11-16

摘要: 针对动态时间弯曲方法计算时间过长的问题,提出增量动态时间弯曲来度量较长时间序列之间的相似性。首先利用动态时间弯曲方法对历史时间序列数据进行相似性度量,得到相应的历史最优弯曲路径和路径中各元素的累积距离代价。其次,通过逆向弯曲度量方法完成当前序列数据 的相似性度量,结合历史数据信息找到与历史弯曲路径相交且度量时间序列距离为当前最小值的新路径,进而实现增量动态时间弯曲的相似性度量。该方法不仅具有良好的度量质量,还具有较高的时间效率。数值实验表明,对于大部分时间序列数据集,新方法的分类准确率和计算性能要优于经典动态时间弯曲。

关键词: 时间序列数据挖掘,动态时间弯曲,增量动态时间弯曲,相似性度量

Abstract: To address the issues on the over expensive time cost,an incremental dynamic time warping (IDTW) to measure the similarity between two time series was proposed.First of all,dynamic time warping (DTW) was used to measure similarity of the past time sequences and retrieves the best warping path and the cumulated distance cost of each element in the warping path.Next,after computing the similarity between the two current time series by backward warping method,a new warping path intersects with the past one was obtained and its warping distance was minimal.Finally,the incremental dynamic warping method was realized to measure similarity.The new method not only has the good quality to measure the similarity but also is efficient to compute.The numerical experiments demonstrate that the classification accuracy and computing performance of IDTW are better than DTW.

Key words: Time series data mining,Dynamic time warping,Incremental dynamic time warping,Similarity measure

[1] 谢福鼎,李迎,孙岩,等.一种基于关键点的时间序列聚类算法[J].计算机科学,2012,39(3):160-162
[2] Li Hai-lin,Guo Chong-hui,Qiu Wang-ren.Similarity measurebased on piecewise linear approximation and derivative dynamic time warping for time series mining[J].Expert Systems with Applications,2011,38(12):14732-14743
[3] Xi X,Keogh E,Shelton C,et al.Fast time series classification using numerosity reduction[C]∥Proceedings of the 23nd International Conference on Machine Learning.2006:1033-1040
[4] 李海林,郭崇慧.基于云模型的时间序列分段聚合近似方法[J].控制与决策,2011,26(10):1525-1529
[5] 陈晓华.基于核密度估计的时间序列多模式发现[J].山东大学学报:工学版,2011(5):46-52
[6] 贾澎涛,何华灿,刘丽,等.时间序列挖掘综述[J].计算机应用研究,2007,24(11):15-29
[7] 林殉,李志蜀,周勇.时间序列序列模式的相似性研究[J].计算机科学,2011,8(9):245-247
[8] 李海林,郭崇慧.基于形态特征的时间序列符号聚合近似方法[J].模式识别与人工智能,2011,24(5):665-672
[9] Keogh E,Pazzani M J.Derivative dynamic time warping[C]∥Proceedings of the 1st SIAM International Conference on Data Mining.2001:1-11
[10] Keogh E,Ratanamahatana C A.Exact indexing of dynamic time warping[J].Knowledge and Information Systems,2005,7(3):358-386
[11] 高学东,崔巍,徐章艳.基于动态时间弯曲的区间值时间序列匹配算法[J].系统工程学报,2007,22(6):664-668
[12] Itakura F.Minimum prediction residual principle applied tospeech recognition[J].IEEE Transaction on Acoustics,Speech and Signal Process,1975,23(1):52-72
[13] Sakoe H,Chiba S.Dynamic programming algorithm optimization for spoken word recognition[J].IEEE Transaction on Acoustics,Speech and Signal Process,1978,26(1):43-49
[14] Sakurai Y,Yoshikawa M,Faloutsos C.FTW:fast similaritysearch under the time warping distance[C]∥Proceedings of the 2005Principles of Database Systems.2005:326-337
[15] Salvador S,Chan P.FastDTW:toward accurate dynamic timewarping in linear time and space[J].Intelligent Data Analysis,2007,11(5):561-580
[16] Keogh E,Zhu Q,Hu B,et al.The UCR Time Series Classification/Clustering Homepage[EB/OL].http://www.cs.ucr.edu/~eamonn/time_series_data/,2012-04-03

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!