利用 "学习排名 XGBoost "和广泛的特征工程进行保护隐私的高峰时间预测

IF 2.4 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC IET Smart Grid Pub Date : 2023-10-22 DOI:10.1049/stg2.12137
Leo Semmelmann, Oliver Resch, Sarah Henni, Christof Weinhardt
{"title":"利用 \"学习排名 XGBoost \"和广泛的特征工程进行保护隐私的高峰时间预测","authors":"Leo Semmelmann,&nbsp;Oliver Resch,&nbsp;Sarah Henni,&nbsp;Christof Weinhardt","doi":"10.1049/stg2.12137","DOIUrl":null,"url":null,"abstract":"<p>In modern power systems, predicting the time when peak loads will occur is crucial for improving efficiency and minimising the possibility of network sections becoming overloaded. However, most works in the load forecasting field are not focusing on a dedicated peak time forecast and are not dealing with load data privacy. At the same time, developing methods for forecasting peak electricity usage that protect customers' data privacy is essential since it could encourage customers to share their energy usage data, leading to more data points for the effective management and planning of power grids. Hence, the authors employ a dedicated Learning to Rank XGBoost algorithm to forecast peak times with only ranks of loads instead of absolute load magnitudes as input data, thereby offering potential privacy-preserving properties. We show that the presented Learning to Rank XGBoost model yields comparable results to a benchmark XGBoost load forecasting model. Additionally, we describe our extensive feature engineering process and a state-of-the-art Bayesian hyperparameter optimisation for selecting model parameters, which leads to a significant improvement of forecasting accuracy. Our method was used in the context of the final round of the international BigDEAL load forecasting challenge 2022, where we consistently achieved high-ranking results in the peak time track and an overall fourth rank in the peak load forecasting track with our general XGBoost model.</p>","PeriodicalId":36490,"journal":{"name":"IET Smart Grid","volume":null,"pages":null},"PeriodicalIF":2.4000,"publicationDate":"2023-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/stg2.12137","citationCount":"0","resultStr":"{\"title\":\"Privacy-preserving peak time forecasting with Learning to Rank XGBoost and extensive feature engineering\",\"authors\":\"Leo Semmelmann,&nbsp;Oliver Resch,&nbsp;Sarah Henni,&nbsp;Christof Weinhardt\",\"doi\":\"10.1049/stg2.12137\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In modern power systems, predicting the time when peak loads will occur is crucial for improving efficiency and minimising the possibility of network sections becoming overloaded. However, most works in the load forecasting field are not focusing on a dedicated peak time forecast and are not dealing with load data privacy. At the same time, developing methods for forecasting peak electricity usage that protect customers' data privacy is essential since it could encourage customers to share their energy usage data, leading to more data points for the effective management and planning of power grids. Hence, the authors employ a dedicated Learning to Rank XGBoost algorithm to forecast peak times with only ranks of loads instead of absolute load magnitudes as input data, thereby offering potential privacy-preserving properties. We show that the presented Learning to Rank XGBoost model yields comparable results to a benchmark XGBoost load forecasting model. Additionally, we describe our extensive feature engineering process and a state-of-the-art Bayesian hyperparameter optimisation for selecting model parameters, which leads to a significant improvement of forecasting accuracy. Our method was used in the context of the final round of the international BigDEAL load forecasting challenge 2022, where we consistently achieved high-ranking results in the peak time track and an overall fourth rank in the peak load forecasting track with our general XGBoost model.</p>\",\"PeriodicalId\":36490,\"journal\":{\"name\":\"IET Smart Grid\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.4000,\"publicationDate\":\"2023-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1049/stg2.12137\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Smart Grid\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/stg2.12137\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Smart Grid","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/stg2.12137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

在现代电力系统中,预测高峰负荷出现的时间对于提高效率和最大限度地降低网段过载的可能性至关重要。然而,负荷预测领域的大多数工作并不专注于专门的高峰期预测,也不涉及负荷数据隐私。同时,开发能够保护客户数据隐私的高峰用电预测方法至关重要,因为这可以鼓励客户共享其能源使用数据,从而为电网的有效管理和规划提供更多的数据点。因此,作者采用了专门的 "学习排名 XGBoost 算法",仅使用负荷排名而非绝对负荷大小作为输入数据来预测高峰时间,从而提供潜在的隐私保护特性。我们展示了所介绍的学习排名 XGBoost 模型与基准 XGBoost 负载预测模型的结果相当。此外,我们还介绍了我们广泛的特征工程过程和用于选择模型参数的最先进的贝叶斯超参数优化方法,这使得预测准确性得到了显著提高。我们的方法在 2022 年国际 BigDEAL 负荷预测挑战赛决赛中得到了应用,我们的通用 XGBoost 模型在峰值时间赛道中始终保持着较高的排名,在峰值负荷预测赛道中总体排名第四。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Privacy-preserving peak time forecasting with Learning to Rank XGBoost and extensive feature engineering

In modern power systems, predicting the time when peak loads will occur is crucial for improving efficiency and minimising the possibility of network sections becoming overloaded. However, most works in the load forecasting field are not focusing on a dedicated peak time forecast and are not dealing with load data privacy. At the same time, developing methods for forecasting peak electricity usage that protect customers' data privacy is essential since it could encourage customers to share their energy usage data, leading to more data points for the effective management and planning of power grids. Hence, the authors employ a dedicated Learning to Rank XGBoost algorithm to forecast peak times with only ranks of loads instead of absolute load magnitudes as input data, thereby offering potential privacy-preserving properties. We show that the presented Learning to Rank XGBoost model yields comparable results to a benchmark XGBoost load forecasting model. Additionally, we describe our extensive feature engineering process and a state-of-the-art Bayesian hyperparameter optimisation for selecting model parameters, which leads to a significant improvement of forecasting accuracy. Our method was used in the context of the final round of the international BigDEAL load forecasting challenge 2022, where we consistently achieved high-ranking results in the peak time track and an overall fourth rank in the peak load forecasting track with our general XGBoost model.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Smart Grid
IET Smart Grid Computer Science-Computer Networks and Communications
CiteScore
6.70
自引率
4.30%
发文量
41
审稿时长
29 weeks
期刊最新文献
Multi‐objective interval planning for 5G base station virtual power plants considering the consumption of photovoltaic and communication flexibility Probabilistic assessment of short‐term voltage stability under load and wind uncertainty Review on reliability assessment of energy storage systems Coordinated recovery of interdependent power and water distribution systems Incentivising peers in local transactive energy markets: A case study for consumers, prosumers and prosumagers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1