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!
|
cited_by | |
---|---|
cites | cdi_FETCH-LOGICAL-c378t-81f3848b176188401770c49f30698cac692274910b7e052673142e0e890ebe203 |
container_end_page | 716 |
container_issue | 6 |
container_start_page | 702 |
container_title | Journal of communications technology & electronics |
container_volume | 67 |
creator | V’yugin, V. V. Trunov, V. G. |
description | 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. |
doi_str_mv | 10.1134/S1064226922060201 |
format | article |
fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2680614107</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A708242886</galeid><sourcerecordid>A708242886</sourcerecordid><originalsourceid>FETCH-LOGICAL-c378t-81f3848b176188401770c49f30698cac692274910b7e052673142e0e890ebe203</originalsourceid><addsrcrecordid>eNp1kdtKxDAQhosoeHwA7wpeCXadpGmSXi6yusrCiofrkmanNVIbTbLgvr0pFXQRb3KY__snM5kkOSUwISRnl48EOKOUl5QCBwpkJzkgRVFkvCjEbjxHORv0_eTQ-1eAvOSQHyR3y74zPabTtnXYqmBsn9omvXe2VrXpjA9GxxuujB40P4hzu3bdJp11qIMzWnXpwqqVP072GtV5PPnej5Ln69nT1TxbLG9ur6aLTOdChkySJpdM1kRwIiUDIgRoVjY58FJqpYcWBCsJ1AKhoFzkhFEElCVgjRTyo-RszPvu7McafaheY0F9fLKiXAInjICI1GSkWtVhZfrGBqdierXCN6Ntj42J8akASRmVkkfD-ZYhMgE_Q6vW3le3jw_b7MUvtl77-IU-Lt60L8GPli2cjLh21nuHTfXuzJtym4pANYyv-jO-6KGjx0e2b9H9dPm_6QspNJfF</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2680614107</pqid></control><display><type>article</type><title>Online Aggregation of Probabilistic Predictions of Hourly Electrical Loads</title><source>Springer Nature</source><creator>V’yugin, V. V. ; Trunov, V. G.</creator><creatorcontrib>V’yugin, V. V. ; Trunov, V. G.</creatorcontrib><description>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.</description><identifier>ISSN: 1064-2269</identifier><identifier>EISSN: 1555-6557</identifier><identifier>DOI: 10.1134/S1064226922060201</identifier><language>eng</language><publisher>Moscow: Pleiades Publishing</publisher><subject>Agglomeration ; Algorithms ; Analysis ; Communications Engineering ; Confidence intervals ; Distribution (Probability theory) ; Distribution functions ; Electrical loads ; Electricity consumption ; Engineering ; Mathematical Models and Computational Methods ; Networks ; Predictions ; Statistical analysis</subject><ispartof>Journal of communications technology & electronics, 2022-06, Vol.67 (6), p.702-716</ispartof><rights>Pleiades Publishing, Inc. 2022. ISSN 1064-2269, Journal of Communications Technology and Electronics, 2022, Vol. 67, No. 6, pp. 702–716. © Pleiades Publishing, Inc., 2022. Russian Text © The Author(s), 2020, published in Informatsionnye Protsessy, 2020, Vol. 20, No. 2, pp. 171–192.</rights><rights>COPYRIGHT 2022 Springer</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c378t-81f3848b176188401770c49f30698cac692274910b7e052673142e0e890ebe203</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,27905,27906</link.rule.ids></links><search><creatorcontrib>V’yugin, V. V.</creatorcontrib><creatorcontrib>Trunov, V. G.</creatorcontrib><title>Online Aggregation of Probabilistic Predictions of Hourly Electrical Loads</title><title>Journal of communications technology & electronics</title><addtitle>J. Commun. Technol. Electron</addtitle><description>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.</description><subject>Agglomeration</subject><subject>Algorithms</subject><subject>Analysis</subject><subject>Communications Engineering</subject><subject>Confidence intervals</subject><subject>Distribution (Probability theory)</subject><subject>Distribution functions</subject><subject>Electrical loads</subject><subject>Electricity consumption</subject><subject>Engineering</subject><subject>Mathematical Models and Computational Methods</subject><subject>Networks</subject><subject>Predictions</subject><subject>Statistical analysis</subject><issn>1064-2269</issn><issn>1555-6557</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp1kdtKxDAQhosoeHwA7wpeCXadpGmSXi6yusrCiofrkmanNVIbTbLgvr0pFXQRb3KY__snM5kkOSUwISRnl48EOKOUl5QCBwpkJzkgRVFkvCjEbjxHORv0_eTQ-1eAvOSQHyR3y74zPabTtnXYqmBsn9omvXe2VrXpjA9GxxuujB40P4hzu3bdJp11qIMzWnXpwqqVP072GtV5PPnej5Ln69nT1TxbLG9ur6aLTOdChkySJpdM1kRwIiUDIgRoVjY58FJqpYcWBCsJ1AKhoFzkhFEElCVgjRTyo-RszPvu7McafaheY0F9fLKiXAInjICI1GSkWtVhZfrGBqdierXCN6Ntj42J8akASRmVkkfD-ZYhMgE_Q6vW3le3jw_b7MUvtl77-IU-Lt60L8GPli2cjLh21nuHTfXuzJtym4pANYyv-jO-6KGjx0e2b9H9dPm_6QspNJfF</recordid><startdate>20220601</startdate><enddate>20220601</enddate><creator>V’yugin, V. V.</creator><creator>Trunov, V. G.</creator><general>Pleiades Publishing</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>XI7</scope><scope>ISR</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>20220601</creationdate><title>Online Aggregation of Probabilistic Predictions of Hourly Electrical Loads</title><author>V’yugin, V. V. ; Trunov, V. G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c378t-81f3848b176188401770c49f30698cac692274910b7e052673142e0e890ebe203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Agglomeration</topic><topic>Algorithms</topic><topic>Analysis</topic><topic>Communications Engineering</topic><topic>Confidence intervals</topic><topic>Distribution (Probability theory)</topic><topic>Distribution functions</topic><topic>Electrical loads</topic><topic>Electricity consumption</topic><topic>Engineering</topic><topic>Mathematical Models and Computational Methods</topic><topic>Networks</topic><topic>Predictions</topic><topic>Statistical analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>V’yugin, V. V.</creatorcontrib><creatorcontrib>Trunov, V. G.</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>Business Insights: Essentials</collection><collection>Gale In Context: Science</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>Journal of communications technology & electronics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>V’yugin, V. V.</au><au>Trunov, V. G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Online Aggregation of Probabilistic Predictions of Hourly Electrical Loads</atitle><jtitle>Journal of communications technology & electronics</jtitle><stitle>J. Commun. Technol. Electron</stitle><date>2022-06-01</date><risdate>2022</risdate><volume>67</volume><issue>6</issue><spage>702</spage><epage>716</epage><pages>702-716</pages><issn>1064-2269</issn><eissn>1555-6557</eissn><abstract>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.</abstract><cop>Moscow</cop><pub>Pleiades Publishing</pub><doi>10.1134/S1064226922060201</doi><tpages>15</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1064-2269 |
ispartof | Journal of communications technology & electronics, 2022-06, Vol.67 (6), p.702-716 |
issn | 1064-2269 1555-6557 |
language | eng |
recordid | cdi_proquest_journals_2680614107 |
source | Springer Nature |
subjects | Agglomeration Algorithms Analysis Communications Engineering Confidence intervals Distribution (Probability theory) Distribution functions Electrical loads Electricity consumption Engineering Mathematical Models and Computational Methods Networks Predictions Statistical analysis |
title | Online Aggregation of Probabilistic Predictions of Hourly Electrical Loads |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T22%3A11%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Online%20Aggregation%20of%20Probabilistic%20Predictions%20of%20Hourly%20Electrical%20Loads&rft.jtitle=Journal%20of%20communications%20technology%20&%20electronics&rft.au=V%E2%80%99yugin,%20V.%20V.&rft.date=2022-06-01&rft.volume=67&rft.issue=6&rft.spage=702&rft.epage=716&rft.pages=702-716&rft.issn=1064-2269&rft.eissn=1555-6557&rft_id=info:doi/10.1134/S1064226922060201&rft_dat=%3Cgale_proqu%3EA708242886%3C/gale_proqu%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c378t-81f3848b176188401770c49f30698cac692274910b7e052673142e0e890ebe203%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2680614107&rft_id=info:pmid/&rft_galeid=A708242886&rfr_iscdi=true |