Subsequence matching of stream synopses under the time warping distance

Authors:
Su-Chen Lin;Mi-Yen Yeh;Ming-Syan Chen
Affiliations:
Dept of Electrical Engineering, National Taiwan University, Taipei, Taiwan;Institute of Information Science, Academia Sinica, Taipei, Taiwan;Dept of Electrical Engineering, National Taiwan University, Taipei, Taiwan
Venue:
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Year:
2010

Citing 4
Cited 1

Scaling up dynamic time warping for datamining applications

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Locally adaptive dimensionality reduction for indexing large time series databases

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping

IEEE Transactions on Knowledge and Data Engineering
Ranked subsequence matching in time-series databases

VLDB '07 Proceedings of the 33rd international conference on Very large data bases

Similar subsequence search in time series databases

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 real datasets show that the proposed method significantly speeds up the pattern matching by sacrificing a little accuracy.