Subsequence Matching in Data Streams
Machiko Toyoda, Yasushi Sakurai · NTT technical review · 2013
Subsequence matching is a basic problem in the field of data stream mining, and dynamic time warping (DTW) is a powerful similarity measure often used for subsequence matching; however, the straightforward method using DTW incurs a high computation cost.In this article, we describe two subsequence matching problems in data streams-() the similarity between a query sequence and a data stream and (2) the similarity between data streams-and we present effective algorithms to solve these problems.We also introduce some applications using these algorithms.