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
A motif is a pair of non-overlapping sequences with very similar shapes in a time series. We study the online topk most similar motif discovery problem. A special case of this problem corresponding to k = 1 was investigated in the literature by Mueen and Keogh . We generalize the problem to any k and propose space-efficient algorithms for solving it. We show that our algorithms are optimal in term of space. In the particular case when k = 1, our algorithms achieve better performance both indoi:10.1137/1.9781611972818.86 dblp:conf/sdm/LamCP11 fatcat:5xxoszjqfndjxfvmov6deqvu4u