Summary: Approximate Embedding-Based Subsequence Matching of
Time Series
Vassilis Athitsos 1
, Panagiotis Papapetrou 2
, Michalis Potamias 2
,
George Kollios 2
, and Dimitrios Gunopulos 3
1
Computer Science and Engineering Department, University of Texas at Arlington
2
Computer Science Department, Boston University
3
Department of Informatics and Telecommunications, University of Athens
ABSTRACT
A method for approximate subsequence matching is introduced,
that significantly improves the efficiency of subsequence match-
ing in large time series data sets under the dynamic time warping
(DTW) distance measure. Our method is called EBSM, shorthand
for Embedding-Based Subsequence Matching. The key idea is to