A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Subsequence Matching of Stream Synopses under the Time Warping Distance
[chapter]
2010
Lecture Notes in Computer Science
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pattern, the work continuously identifies all the matching subsequences for a stream as the histograms are generated. To effectively reduce the computation time, we design a Weighted Dynamic Time Warping (WDTW) algorithm which computes the warping distance directly between two histogram-based synopses. Our experiments on
doi:10.1007/978-3-642-13672-6_35
fatcat:r5j45ibetnc4ljisodhb7cq2y4