Efficient Subsequence Search on Streaming Data Based on Time Warping Distance
release_texvll4rgvfq3h6ynqmqet2xvi
by
Sura Rodpongpun, Vit Niennattrakul, Chotirat Ann Ratanamahatana
Abstract
Many algorithms have been proposed to deal with subsequence similarity search problem in time series data stream. Dynamic Time Warping (DTW), which has been accepted as the best distance measure in time series similarity search, has been used in many research works. SPRING and its variance were proposed to solve such problem by mitigating the complexity of DTW. Unfortunately, these algorithms produce meaningless result since no normalization is taken into account before the distance calculation. Recently, GPUs and FPGAs were used in similarity search supporting subsequence normalization to reduce the computation complexity, but it is still far from practical use. In this work, we propose a novel Meaningful Subsequence Matching (MSM) algorithm which produces meaningful result in subsequence matching by considering global constraint, uniform scaling, and normalization. Our method significantly outperforms the existing algorithms in terms of both computational cost and accuracy.
In application/xml+jats
format
Archived Files and Locations
application/pdf 1.4 MB
file_zidbkpsbanhnjg2uxox3nz73ce
|
ph01.tci-thaijo.org (web) web.archive.org (webarchive) |
article-journal
Stage
published
Date 1970-01-01
access all versions, variants, and formats of this works (eg, pre-prints)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar