Robust Load Forecasting using Modified Bacterial Foraging Optimization Algorithm with Deep Learning for Smart Grid Environment
Bibliographic record
Abstract
Smart Grid (SG) is a digitally assisted power grid with automatic ability to manage electricity and data among service and user. SG data streams can be heterogenous and keep a dynamic atmosphere, but the recent machine learning (ML) approaches are static and stand obsolete in such environments. Load forecasting roles a vital play in efficient energy planning and distribution in SG. But, because of the unpredictable and nonlinear infrastructure of SGs and huge database's difficult nature, accurate load forecasting is still challenging. This study offers the design of Robust Load Forecasting using Modified Bacterial Foraging Optimization Algorithm with Deep Learning (RLF-MBFODL) approach for SG environment. The main purpose of the RLF-MBFODL approach is to anticipate the occurrence of load in the SG atmosphere. The primary phase of the RLF-MBFODL technique involves MBFO algorithm for feature selection process. Next, deep belief network (DBN) model is employed for forecasting the load. Finally, cheetah optimization algorithm (COA) can be applied for optimal hyperparameter selection purposes. In order to assess the simulation results of the RLF-MBFODL technique, a series of experimentation analyses were accomplished. The output exhibits the better performance of the RLF-MBFODL technique in terms of different evaluation measures.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".