Confidence bands for time series data

Simultaneous confidence intervals, or confidence bands , provide an intuitive description of the variability of a time series. Given a set of N time series of length M , we consider the problem of finding a confidence band that contains a (1-α ) -fraction of the observations. We construct such confidence bands by finding the set of N-K time series whose envelope is minimized. We refer to this problem as the minimum width envelope problem. We show that the minimum width envelope problem is 𝐍𝐏 -hard, and we develop a greedy heuristic algorithm, which we compare to quantile- and distance-based confidence band methods. We also describe a method to find an effective confidence level α _eff and an effective number of observations to remove K_eff , such that the resulting confidence bands will keep the family-wise error rate below α . We evaluate our methods on synthetic and real datasets. We demonstrate that our method can be used to construct confidence bands with guaranteed family-wise error rate control, also when there is too little data for the quantile-based methods to work.