现代电子技术2017，Vol.40Issue(6)：25-30,6.DOI:10.16652/j.issn.1004-373x.2017.06.007
一种基于动态时间弯曲距离的快速子序列匹配算法
Fast subsequence matching algorithm based on dynamic time warping distance
刘晓影1
作者信息
- 1. 中国电子科技集团公司第十五研究所,北京100083
- 折叠
摘要
Abstract
It is very time-consuming to calculate the distance between time sequences by using dynamic time warping distance,especially when the subsequence matching in large time-series databases is concerned.A new method of lower bound distance is presented in this paper,which can quickly filter the time sequences which are unable to satisfy the result condition,so as to improve the query speed.It is proven that the true results can not be lost if the method is used.To further increase the query speed,a technique for building an index based on skyline bounding region is also proposed.Some experiments with the data from real data set and synthetic data set were carried out to verify the performance of the methods.The results reveal that the method has robostness in the scale of database and sequence length.关键词
时间弯曲距离/低边界距离/范围查询/数据库Key words
time warping distance/lower bounding distance/range query/database分类
信息技术与安全科学引用本文复制引用
刘晓影..一种基于动态时间弯曲距离的快速子序列匹配算法[J].现代电子技术,2017,40(6):25-30,6.
