arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0903.0041cs.AI
收藏

学习DTW全局约束的时间序列分类

Learning DTW Global Constraint for Time Series Classification

Chulalongkorn University(朱拉隆功大学)

Vit Niennattrakul, Chotirat Ann Ratanamahatana

摘要:

1-最近邻算法是一种基于动态时间规整距离的时间序列分类器。由于语音界引入了全局约束,人们提出了许多全局约束模型,包括Sakoe-Chiba(S-C)带、Itakura谱图和Ratanamahatana-Keogh(R-K)带。R-K带是一种通用的全局约束模型,可以有效地表示任意形状和大小的全局约束。然而,我们需要一个好的学习算法来发现最合适的R-K波段集合,并且当前的R-K波段学习算法仍然遭受“过拟合”现象。本文提出了两种新的学习算法,频带边界提取算法和迭代学习算法。从每个类中所有可能的翘曲路径的界限计算频带边界提取,并且从原始R-K频带学习调整迭代学习。我们还使用了一个剪影指数,一个著名的聚类验证技术,作为一个启发式函数,和下限函数,LB_Keogh,以提高预测速度。20个数据集,从研讨会和挑战的时间序列分类,在SIGKDD 2007年举行的同时,用来评估我们的方法。

英文摘要:

1-Nearest Neighbor with the Dynamic Time Warping (DTW) distance is one of the most effective classifiers on time series domain. Since the global constraint has been introduced in speech community, many global constraint models have been proposed including Sakoe-Chiba (S-C) band, Itakura Parallelogram, and Ratanamahatana-Keogh (R-K) band. The R-K band is a general global constraint model that can represent any global constraints with arbitrary shape and size effectively. However, we need a good learning algorithm to discover the most suitable set of R-K bands, and the current R-K band learning algorithm still suffers from an 'overfitting' phenomenon. In this paper, we propose two new learning algorithms, i.e., band boundary extraction algorithm and iterative learning algorithm. The band boundary extraction is calculated from the bound of all possible warping paths in each class, and the iterative learning is adjusted from the original R-K band learning. We also use a Silhouette index, a well-known clustering validation technique, as a heuristic function, and the lower bound function, LB_Keogh, to enhance the prediction speed. Twenty datasets, from the Workshop and Challenge on Time Series Classification, held in conjunction of the SIGKDD 2007, are used to evaluate our approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑