A decomposition‐based multi‐time dimension long short‐term memory model for short‐term electric load forecasting
Bibliographic record
Abstract
Abstract Short‐term load forecasting is essential to power systems management. However, most existing forecasting methods fail to fully consider how to rationally integrate the intrinsic time‐related dimensions of electric load data and the decomposition methods into machine learning models so that their prediction accuracy and robustness still have much room for improvement. To solve this problem, this paper proposes a decomposition‐based multi‐time dimension long short‐term memory (DB‐MTD‐LSTM) model for short‐term electric load forecasting (STELF). In DB‐MTD‐LSTM, empirical mode decomposition with adaptive noise (CEEMDAN) is first introduced to smooth non‐linear non‐stationary electric load data and constrain the modal aliasing or noise of decomposed electric load data in the traditional decomposed method. A joint relevant time dimensions method (JRTDM) is then developed using autocorrelation analysis to rationally extract the temporal characteristics of decomposed data in multiple time dimensions. An improved LSTM called MTD‐LSTM is developed by combining JRTDM with LSTM, which can effectively apply multi‐dimensional time characteristics of the decomposed load to improve the predictive accuracy and robustness. Several datasets from Australia and China are performed to check the predictive performance of DB‐MTD‐LSTM. Experimental results verify that DB‐MTD‐LSTM has better predictive accuracy and satisfactory robustness compared with state‐of‐the‐art and conventional predictive models.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 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.000 | 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".