A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...