.png){kind=icon}
返回
Shape-based template matching for time series data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2011.04.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Dynamic time warping (DTW) distance has been proven to be one of the most accurate distance measures for time series classification. However, its calculation complexity is its own major drawback, especially when a massive training database has to be searched. Although many techniques have been proposed to speed up the search including indexing structures and lower bounding functions, for large databases, it is still untenable to embed the algorithm and search through the entire database of a system with limited resources, e.g., tiny sensors, within a given time. Therefore, a template matching is a solution to efficiently reduce storage and computation requirements; in other words, only a few time series sequences have to be retrieved and compared with an incoming query data. In this work, we propose a novel template matching framework with the use of DTW distance, where a shape-based averaging algorithm is utilized to construct meaningful templates. Our proposed framework demonstrates its utilities, where classification time speedup is in orders of magnitude, while maintaining good accuracy to rival methods. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Time series
Template matching
Shape averaging
Dynamic time warping
Classification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
分享收藏Sulphasomizole (5-p-Aminobenzenesulphonamido-3-Methylisothiazole): A New Antibacterial Sulphonamide.png)
Nature
NatureIF0
PREAI
分享收藏
查看更多内容