Can Automated Smoothing Significantly Improve Benchmark Time Series Classification Algorithms?

James Large, Paul Southam, Anthony Bagnall

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)
14 Downloads (Pure)


tl;dr: no, it cannot, at least not on average on the standard archive problems. We assess whether using six smoothing algorithms (moving average, exponential smoothing, Gaussian filter, Savitzky-Golay filter, Fourier approximation and a recursive median sieve) could be automatically applied to time series classification problems as a preprocessing step to improve the performance of three benchmark classifiers (1-Nearest Neighbour with Euclidean and Dynamic Time Warping distances, and Rotation Forest). We found no significant improvement over unsmoothed data even when we set the smoothing parameter through cross validation. We are not claiming smoothing has no worth. It has an important role in exploratory analysis and helps with specific classification problems where domain knowledge can be exploited. What we observe is that the automatic application does not help and that we cannot explain the improvement of other time series classification algorithms over the baseline classifiers simply as a function of the absence of smoothing.
Original languageEnglish
Title of host publicationInternational Conference on Hybrid Artificial Intelligence Systems
ISBN (Electronic)978-3-030-29859-3
ISBN (Print)978-3-030-29858-6
Publication statusPublished - 5 Sep 2019

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Cite this