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...
A variety of techniques currently exist for measuring the similarity between time series datasets. Of these techniques, the methods whose matching criteria is bounded by a specifi...
We propose a method of music melody matching based on their “continuous” (or “time-frame-based”) pitch contours. Most previous methods using frame-based contours either ma...
We introduce a method to discover optimal local patterns, which concisely describe the main trends in a time series. Our approach examines the time series at multiple time scales ...
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...