Dynamic time warping constraint learning for large margin nearest neighbor classification

Abstract

Nearest neighbor (NN) classifier with dynamic time warping (DTW) is considered to be an effective method for time series classification. The performance of NN-DTW is dependent on the DTW constraints because the NN classifier is sensitive to the used distance function. For time series classification, the global path constraint of DTW is learned for optimization of the alignment of time series by maximizing the nearest neighbor hypothesis margin. In addition, a reduction technique is combined with a search process to condense the prototypes. The approach is implemented and tested on UCR datasets. Experimental results show the effectiveness of the proposed method. 2011 Elsevier Inc. All rights reserved.

DOI: 10.1016/j.ins.2011.03.001

Extracted Key Phrases

12 Figures and Tables

Statistics

0102030201220132014201520162017
Citations per Year

fewer than 50 Citations

Semantic Scholar estimates that this publication has 50 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Yu2011DynamicTW, title={Dynamic time warping constraint learning for large margin nearest neighbor classification}, author={Daren Yu and Xiao Yu and Qinghua Hu and Jinfu Liu and Anqi Wu}, journal={Inf. Sci.}, year={2011}, volume={181}, pages={2787-2796} }