Multiple Kernel Learning-Based Transfer Regression for Electric Load Forecasting
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Electric load forecasting, especially short-term load forecasting (STLF), is becoming more and more important for power system operation. We propose to use multiple kernel learning (MKL) for residential electric load forecasting which provides more flexibility than traditional kernel methods. Computation time is an important issue for short-term forecasting, especially for energy scheduling. However, conventional MKL methods usually lead to complicated optimization problems. Another practical issue for this application is that there may be a very limited amount of data available to train a reliable forecasting model for a new house, while at the same time we may have historical data collected from other houses which can be leveraged to improve the prediction performance for the new house. In this paper, we propose a boosting-based framework for MKL regression to deal with the aforementioned issues for STLF. In particular, we first adopt boosting to learn an ensemble of multiple kernel regressors and then extend this framework to the context of transfer learning. Furthermore, we consider two different settings: homogeneous transfer learning and heterogeneous transfer learning. Experimental results on residential data sets demonstrate that forecasting error can be reduced by a large margin with the knowledge learned from other houses.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Multiple kernel learning, conic duality, and the SMO algorithm
Bach, F. R., Lanckriet, G. R. G., & Jordan, M. I. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015424 · Cited by 1,453
Cited by
Review and prospect of data-driven techniques for load forecasting in integrated energy systems
Zhu, J., Dong, H., Zheng, W., Li, S., Huang, Y., & Xi, L. (2022) · Applied Energy · doi:10.1016/j.apenergy.2022.119269 · Cited by 298
Ensemble Learning for Charging Load Forecasting of Electric Vehicle Charging Stations
Huang, X., Wu, D., & Boulet, B. (2020) · 2020 IEEE Electric Power and Energy Conference (EPEC) · doi:10.1109/epec48502.2020.9319916 · Cited by 76
“Ensemble learning [21], a technique to exploit the benefit of combining more than one machine learning model, has not been well studied for EV charging load forecasting problems.”
MethodSelf-citation
Metadata
- Authors
- Wu, D., Wang, B., Precup, D., & Boulet, B.
- Venue
- IEEE Transactions on Smart Grid
- Published
- 2020-03
- Volume
- 11
- Issue
- 2
- Pages
- 1183-1192
- ISSN
- 1949-3053 (ISSN-L)
- 1949-3061
- OpenAlex
- W2965525929
- Cited by
- 159
- References
- 2
- FWCI
- 6.17
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.