Short-Term Load Forecasting of Microgrid via Hybrid Support Vector Regression and Long Short-Term Memory Algorithms
Bibliographic record
Abstract
Short-Term Load Forecasting (STLF) is the most appropriate type of forecasting for both electricity consumers and generators. In this paper, STLF in a Microgrid (MG) is performed via the hybrid applications of machine learning. The proposed model is a modified Support Vector Regression (SVR) and Long Short-Term Memory (LSTM) called SVR-LSTM. In order to forecast the load, the proposed method is applied to the data related to a rural MG in Africa. Factors influencing the MG load, such as various household types and commercial entities, are selected as input variables and load profiles as target variables. Identifying the behavioral patterns of input variables as well as modeling their behavior in short-term periods of time are the major capabilities of the hybrid SVR-LSTM model. To present the efficiency of the suggested method, the conventional SVR and LSTM models are also applied to the used data. The results of the load forecasts by each network are evaluated using various statistical performance metrics. The obtained results show that the SVR-LSTM model with the highest correlation coefficient, i.e., 0.9901, is able to provide better results than SVR and LSTM, which have the values of 0.9770 and 0.9809, respectively. Finally, the results are compared with the results of other studies in this field, which continued to emphasize the superiority of the SVR-LSTM model.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".