For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
This paper presents a classification approach, where a sample is represented by a set of feature vectors called an attributed point pattern. Some attributes of a point are transf...
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...