返回
Improved LDTW Algorithm Based on the Alternating Matrix and the Evolutionary Chain Tree
DOI:10.3390/s22145305.png)
摘要
En 中文
Dynamic time warping under limited warping path length (LDTW) is a state-of-the-art time series similarity evaluation method. However, it suffers from high space-time complexity, which makes some large-scale series evaluations impossible. In this paper, an alternating matrix with a concise structure is proposed to replace the complex three-dimensional matrix in LDTW and reduce the high complexity. Furthermore, an evolutionary chain tree is proposed to represent the warping paths and ensure an effective retrieval of the optimal one. Experiments using the benchmark platform offered by the University of California-Riverside show that our method uses 1.33% of the space, 82.7% of the time used by LDTW on average, which proves the efficiency of the proposed method.
Keyword:
dynamic time warping
time series
similarity evaluation
warping path
space-time complexity
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
Digital Storytelling for 21<sup>st</sup>-Century Skills in Virtual Learning Environments
Weighted dynamic time warping for time series classification基于加权动态时间规整的时间序列分类
PATTERN RECOGNITION
IF7.6
Multi-Temporal Data Fusion in MS and SAR Images Using the Dynamic Time Warping Method for Paddy Rice Classification
AGRICULTURE-BASEL
IF3.6
Motion Similarity Evaluation between Human and a Tri-Co Robot during Real-Time Imitation with a Trajectory Dynamic Time Warping Model
SENSORS
IF3.5
An Improved Self-Training Method for Positive Unlabeled Time Series Classification Using DTW Barycenter Averaging
SENSORS
IF3.5

