Loading…
Online Aggregation of Probabilistic Predictions of Hourly Electrical Loads
In this paper, we consider the problem of online probabilistic time series forecasting. The difference between a probabilistic prediction (distribution function) and a numerical outcome is measured using a loss function (scoring rule). In practical statistics, the Continuous Ranked Probability Score...
Saved in:
Published in: | Journal of communications technology & electronics 2022-06, Vol.67 (6), p.702-716 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this paper, we consider the problem of online probabilistic time series forecasting. The difference between a probabilistic prediction (distribution function) and a numerical outcome is measured using a loss function (scoring rule). In practical statistics, the Continuous Ranked Probability Score (CRPS) rule is often used to estimate the discrepancy between probabilistic predictions and quantitative outcomes. Here, we consider the case when several competing methods (experts) give their predictions in the form of distribution functions. Expert predictions are provided with confidence levels. We propose an algorithm for online aggregation of these distribution functions with allowance for the confidence levels to expert forecasts. The discounted error of the proposed algorithm with allowance for the confidence levels is estimated in the form of a comparison of the cumulative losses of the algorithm and the losses of experts. A technology for constructing predictive expert algorithms and aggregating their probabilistic predictions using the example of the problem of predicting electricity consumption 1 or more hours ahead was developed. The results of numerical experiments using real data are presented. |
---|---|
ISSN: | 1064-2269 1555-6557 |
DOI: | 10.1134/S1064226922060201 |