An Improved Approach to Enhance Training Performance of ANN and the Prediction of PV Power for Any Time-Span without the Presence of Real-Time Weather Data
Bibliographic record
Abstract
In this work, an improved approach to enhance the training performance of an Artificial Neural Network (ANN) for prediction of the output of renewable energy systems is proposed. Using the proposed approach, a significant reduction of the Mean Squared Error (MSE) in training performance is achieved, specifically from 4.45 × 10−7 to 3.19 × 10−10. Moreover, a simplified application of the already trained ANN is introduced through which photovoltaic (PV) output can be predicted without the availability of real-time current weather data. Moreover, unlike the existing prediction models, which ask the user to apply multiple inputs in order to forecast power, the proposed model requires only the set of dates specifying forecasting period as the input for prediction purposes. Moreover, in the presence of the historical weather data this model is able to predict PV power for different time spans rather than only for a fixed period. The prediction accuracy of the proposed model has been validated by comparing the predicted power values with the actual ones under different weather conditions. To calculate actual power, the data were obtained from the National Renewable Energy Laboratory (NREL), USA and from the Universiti Teknologi Malaysia (UTM), Malaysia. It is envisaged that the proposed model can be easily handled by a non-technical user to assess the feasibility of the photovoltaic solar energy system before its installation.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 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".