• Aucun résultat trouvé

Impact of Warping vs Smoothing for Time Series Similarity

N/A
N/A
Protected

Academic year: 2022

Partager "Impact of Warping vs Smoothing for Time Series Similarity"

Copied!
1
0
0

Texte intégral

(1)

Impact of Warping vs Smoothing for Time Series Similarity

Frank H¨oppner

Ostfalia University of Applied Sciences

Dept. of Computer Science, D-38302 Wolfenb¨uttel, Germany

Introduction. When dealing with time series, the application of a smoothing filter (to get rid of random fluctuations and better recognise the relevant structure) is usually one of the first steps. In the literature on time series similarity measures, however, the impact of smoothing is not explicitly or systematically considered – despite extensive experiments in, e.g., [2]. Instead, complex similarity measures are frequently applied (e.g. dynamic time warping (DTW)), which implicitly deal with noise, but mainly with temporal dilation and translation effects. So up to now it is unclear, to what extent the good performance of DTW is due to its smoothing or warping capabilities.

Optimal Filter. In this work we consider a simple Euclidean distance applied to preprocessed (smoothed) time series. It is unlikely that one similarity measure fits all problem types (or data sets), so by choosing an appropriate filter, we may adopt to the problem at hand. The filter is automatically determined given a training set of classified series, such that distances between series of the same (different) class are minimised (maximised). The obtained similarity measure is then tested in cross-validated 1-NN classification for various data sets (as in [2]) and compared against the DTW performance. Starting from Euclidean distance (without any preprocessing) as a baseline, it turns out that for many data sets a substantial fraction of the performance improvement obtained with DTW is also obtained by choosing the appropriate filter. In some cases, the performance is even better than with DTW, which is due to the fact that a filter is a versatile tool: for some problems it may be advantageous to distinguish time series by their derivative rather than the original series and in such cases a filter that estimates the derivative may be retrieved. For further details the reader is referred to [1].

References

1. F. H¨oppner. Optimal filtering for time series classification. InProc. 16th Int. Conf.

Intelligent Data Engineering and Automated Learning, 2015.

2. X. Wang, A. Mueen, H. Ding, G. Trajcevski, P. Scheuermann, and E. Keogh. Ex- perimental comparison of representation methods and distance measures for time series data. Data Mining and Knowledge Discovery, 26(2):275–309, Feb. 2012.

Copyright c 2015 by the paper’s authors. Copying permitted only for private and academic purposes. In: R. Bergmann, S. G¨org, G. M¨uller (Eds.): Proceedings of the LWA 2015 Workshops: KDML, FGWM, IR, and FGDB. Trier, Germany, 7.-9.

October 2015, published at http://ceur-ws.org

92

Références

Documents relatifs

To cite this version: Chakroun, Chedlia and Bellatreche, Ladjel and Ait Ameur, Yamine It is Time to propose a Complete Methodology for Designing Semantic Databases.. Any

Given a Hilbert space H characterise those pairs of bounded normal operators A and B on H such the operator AB is normal as well.. If H is finite dimensional this problem was solved

I shall obviously not forget our Scientific Committee and the Sorbonne Law School and in particular its director and the administrators of the external relations

Nous n’oublions évidemment pas les membres de notre comité scientifique ainsi que l’École de droit de la Sorbonne et notamment son directeur et les administratrices du

Under the arrival process and service time distributions described in Section 3 and the parameter values in Table 3, we have validated our simulation model by comparing the

New Brunswick is increasing its training of medi- cal students with the opening of the Saint John Campus of Dalhousie University’s medical school.. At the same time,

Previously, one- time digital signatures based on hash functions involved hundreds of hash function computations for each signature; we show that given online ac- cess to a

(ii) At time t = 0, the acceleration of the stone is equal to the acceleration of free fall.. Give the name of the force accelerating the stone at time t