Electric Load Forecasting with Deep Machine Learning
Bibliographic record
Abstract
The most commonly used form of energy in houses, factories, buildings and agriculture is the electrical energy, however, in recent years, there has been an increase in electrical energy demand due to technology advancements and rise in population, therefore an appropriated forecasting system must be developed to predict these demands as accurately as possible. For this purpose, five models were selected, they are Bidirectional-Long Short Term Memory (Bi-LSTM), Feed Forward Neural Network (FFNN), Long Short Term Memory (LSTM), Nonlinear Auto Regressive network with eXogenous inputs (NARX) and Multiple Linear Regression (MLR). This paper will demonstrate the development of these selected models using MATLAB and an android mobile application, which is used to visualize and interact with the data. The performance of the selected models was evaluated by performing the Mean Absolute Percent Error (MAPE), the selected historical data used to perform the MAPE was obtained from Toronto, Canada and Tasmania, Australia, where the year 2006 until 2016 was used as training data and the year 2017 was used to test the MAPE of the historical data with the models’ data. It is observed that the NARX model had the least MAPE for both the regions resulting in 1.9% for Toronto, Canada and 2.9% for Tasmania, Australia. Google cloud is used as the IoT (Internet of Things) platform for NARX data model, the 2017 datasets is converted to JavaScript Object Notation (JSON) file using JavaScript programming language, for data visualization and analysis for the android mobile application.
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.001 | 0.001 |
| 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.002 | 0.001 |
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".