作者: Xi Wang , Mingxing Jiang , Sheng Chen , Chao Yang , Wei Jing
关键词: Mathematics 、 Pattern recognition 、 Overhead (computing) 、 Approximation algorithm 、 Matching (graph theory) 、 Euclidean distance 、 Blossom algorithm 、 Dynamic time warping 、 Series (mathematics) 、 Artificial intelligence 、 Similarity (geometry)
摘要: Feature-points based time series approximation representation utilizes the tendency information, but lacks consideration of details. DTW (Dynamic Time Warping) similarity measurement eliminates line warp, computation complexity is high. Based on feature-points and DTW, this paper proposed a hybrid matching algorithm. Firstly, we extracted as coarse-grained representation, calculated distance between feature-points, then applied uniform sampling segmentations fine-grained Euclidean corresponding segmentations, at last, summed two distances final distance. The algorithm achieved high accuracy while lowered overhead. This used several data sets from UCR to do experiments, verified effectiveness