Improvement of Dynamic Time Warping(DTW)Algorithm

摘要：

　　Dynamic time warping algorithm is widely used in similar search of time series.However,large scales of route search in existing algorithms resulting in low operational efficiency.In order to improve the efficiency of dynamic time warping algorithm,this paper put forward an improved algorithm,which plans out a three rectangular area in the search area of the existing algorithms,search path wont arrive the points outside the rectangular area,thus further reduced the search range of regular path.To some extent,this algorithm reduces computation of original algorithm,thus improving the operational efficiency.The improvement is more pronounced when two time series are longer.

关键词： dynamic time warping time series similar search warping path Euclidean distance

作者: Yuansheng Lou Huanhuan Ao Yuchao Dong

作者单位: College of Computer and Information Ho Hai University Nanjing,China

会议类型: 国际会议

会议名称: The 14th International Symposium on Distributed Computing and Applications to Business,Engineering and Science(DCABES 2015)(第十四届分布式计算及其应用国际学术研讨会)

会议地点: 贵阳

会议语种:英文

页码: 384-387

在线出版日期: 2015-08-18（万方平台首次上网日期，不代表论文的发表时间）