Bootstrapping time series? It is meant in a way that we generate multiple new training data for statistical forecasting methods like ARIMA or triple exponential smoothing (Holt-Winters method etc.) to improve forecasting accuracy.
It is called bootstrapping, and after applying the forecasting method on each new time series, forecasts are then aggregated by average or median – then it is bagging – bootstrap aggregating.
It is proofed by multiple methods, e.g. in regression, that bagging helps improve predictive accuracy – in methods like classical bagging, random forests, gradient boosting methods and so on.
The bagging methods for time series forecasting were used also in the latest M4 forecasting competition.
For residential electricity consumption (load) time series (as used in my previous blog posts),
I proposed three new bootstrapping methods for time series forecasting methods.
The first one is an enhancement of the originally proposed method by Bergmeir – link to article – and two clustering-based methods.
I also combined classical bagging for regression trees and time series bagging to create ensemble forecasts – I will cover it in some next post. These methods are all covered in the journal article entitled: Density-based Unsupervised Ensemble Learning Methods for Time Series Forecasting of Aggregated or Clustered Electricity Consumption.
In this blog post, I will cover:
- an introduction to the bootstrapping of time series,
- new bootstrapping methods will be introduced,
- extensive experiments with 7 forecasting methods and 4 bootstrapping methods will be described and analysed on a part of M4 competition dataset.
Bootstrapping time series data
Firstly, read the M4 competition data, which compromise 100 thousand time series and load all the needed packages.
I will use only time series with hourly frequency (so with the highest frequency from M4 dataset, and they can have daily and also weekly seasonality), because I use at work also time series with double-seasonality (quarter-hourly or half-hourly data).
The high (or double) period (frequency) also means higher complexity and challenge, therefore it is great for this use case 🙂
Let’s plot random time series from the dataset:
Bootstrap aggregating (bagging) is an ensemble meta-algorithm (introduced by Breiman in 1996), which creates multiple versions of learning set to produce multiple numbers of predictions. These predictions are then aggregated, for example by arithmetic mean.
For time dependent data with a combination of statistical forecasting methods, the classical bagging can’t be used – so sampling (bootstrapping) with replacement.
We have to sample data more sophisticated – based on seasonality or something similar.
One of the used bootstrapping method is Moving Block Bootstrap (MBB) that uses a block (defined by seasonality for example) for creating new series.
However, we don’t use the whole time series as it is, but we bootstrap only its remainder part from STL decomposition (this bootstrapping method was proposed by Bergmeir et al. in 2016).
This method is implemented in the
forecast package in
bld.mbb.bootstrap function, let’s use it on one time series from M4 competition dataset:
We can see that where values of the time series are low, there bld.mbb method fails to bootstrap new values around original ones (red line).
Notice also that variance of bootstrapped time series is very high and values fly somewhere more than 30% against original values.
For this reason, I proposed a smoothed version of the bld.mbb method for reducing variance (Laurinec et al. 2019). I smoothed the remainder part from STL decomposition by exponential smoothing, so extreme noise was removed.
Let’s use it (source code is available on my GitHub repo):
We can see that the variance was nicely lowered, but the final time series are sometimes really different from the original.
It is not good when we want to use them for forecasting.
Therefore, I developed (designed) another two bootstrapping methods based on K-means clustering.
The first step of the two methods is identical – automatic clustering of univariate time series – where automatic means that it estimates the number of clusters from a defined range of clusters by Davies-Bouldin index.
The first method, after clustering, samples new values from cluster members, so it isn’t creating new values.
Let’s plot results:
We can change the range of the number of clusters to be selected to lower to increase the variance of bootstrapped time series.
Let’s try increase number of clusters to decrease variance:
We can see that the variance is much lower against MBB based methods. But we have still the power to increase it if we change the range of number of clusters.
The second proposed K-means based method is sampling new values randomly from Gaussian distribution based on parameters of created clusters (mean and variance). Let’s use it on our selected time series:
We can see nicely distributed values around the original time series, but will be it beneficial for forecasting?
We can also check all four bootstrapping methods in one plot by wrapper around above calls:
When the time series is non-stationary, the clustering bootstrapping methods can oscillate little-bit badly.
The clustering-based bootstrapping methods could be enhanced by for example differencing to be competitive (applicable) for non-stationary time series with a strong linear trend.
Forecasting with bootstrapping
For evaluating four presented bootstrapping methods for time series, to see which is the most competitive in general,
experiments with 6 statistical forecasting methods were performed on all 414 hourly time series from the M4 competition dataset.
Forecasts from bootstrapped time series were aggregated by the median. Also, simple base methods were evaluated alongside seasonal naive forecast.
The six chosen statistical base forecasting methods were:
- STL+ETS (both
- triple exponential smoothing with damped trend (
smoothpackage – named ES (AAdA)),
- Holt-Winters exponential smoothing (
- dynamic optimized theta model (
forecThetapackage – named DOTM),
- and standard theta model (
Forecasting results were evaluated by sMAPE and ranks sorted by sMAPE forecasting accuracy measure.
The source code that generates forecasts from the all mentioned methods above and process results are available on my GitHub repository.
The first visualization of results shows mean sMAPE by base forecasting method:
Best methods based on average sMAPE are STL+ETS with s.MBB and DOTM with s.MBB bootstrapping.
Our proposed s.MBB bootstrapping method won’s 5 times from 6 based on average sMAPE.
The next graph shows boxplot of Ranks:
We can see very tight results amongst base learners, MBB and s.MBB methods.
So, let’s see average Rank instead:
As was seen in the previous plot, it changes and it depends on a forecasting method, but very slightly better results have original MBB method over my s.MBB, but both beats base learner 5 times from 6.
KM-based bootstraps failed to beat base learner 4 times from 6.
Let’s be more curious about distribution of Ranks…I will show you plot of Rank counts:
We can see that KM-based bootstrapping can be first or second too!
Around 25-times for each forecasting method were these 2 boot. methods first, and around 2-times more second…not that bad.
Also, the seasonal naive forecast can be on some types of time series best against more sophisticated statistical forecasting methods…
However, MBB and s.MBB methods are best and most of the time are in the first two ranks.
In this blog post, I showed you how to simply use four various bootstrapping methods on time series data. Then, the results of experiments performed on the M4 competition dataset were shown. Results suggest that bootstrapping can be very useful for improving forecasting accuracy.
 Bergmeir C., Hyndman R.J., Benitez J.M.: Bagging exponential smoothing methods using stl decomposition and box-cox transformation. International Journal of Forecasting, 32(2):303-312, (2016)
 Laurinec P., Loderer M., Lucka M. et al.: Density-based unsupervised ensemble learning methods for time series forecasting of aggregated or clustered electricity consumption, Journal Intelligent Information Systems, 53(2):219-239, (2019). DOI link