A Stacking Learning Model Based on Multiple Similar Days for Short-Term Load Forecasting
Bibliographic record
Abstract
It is challenging to obtain accurate and efficient predictions in short-term load forecasting (STLF) systems due to the complexity and nonlinearity of the electric load signals. To address these problems, we propose a hybrid predictive model that includes a sliding-window algorithm, a stacking ensemble neural network, and a similar-days predictive method. First, we leverage a sliding-window algorithm to process the time-series electric load data with high nonlinearity and non-stationarity. Second, we propose an ensemble learning scheme of stacking neural networks to improve forecasting performance. Specifically, the stacking neural networks contain two types of networks: the base-layer and the meta-layer networks. During the pre-training process, the base-layer network integrates a radial basis function (RBF), random vector functional link (RVFL), and backpropagation neural network (BPNN) to provide a robust predictive model. The meta-layer network utilizes a deep belief network (DBN) and the improved broad learning system (BLS) to enhance predictive accuracy. Finally, the similar-days prediction method is developed to extract the relationship of electric load data in different time dimensions, further enhancing the robustness and accuracy of the model. To demonstrate the effectiveness of our model, it is evaluated using real data from five regions of the United States in three consecutive years. We compare our method with several state-of-the-art and conventional neural-network-based models. Our proposed algorithm improves the prediction accuracy by 16.08%, 16.83%, and 22.64% compared to DWT-EMD-RVFL, SWT-LSTM, and EMD-BLS, respectively. Empirical results demonstrate that our model achieves better accuracy and robustness compared with the baselines.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".