Computational Intelligence Based Snow Cover Prediction for Photovoltaic Systems
Bibliographic record
Abstract
In northern snow-prone areas, photovoltaic (PV) systems are getting more popular. Accumulations of snow on panels after snowfall events, as a major challenge for PV systems’ efficient use in these regions, can attenuate or obstruct solar radiation reaching the surface of the PV cells and cause a significant reduction in the PV system’s power generation. This is an important issue in PV power forecasting (PVPF) for PV-penetrated power systems’ scheduling. To address this issue, data-driven short-term snow cover prediction models for PV systems are proposed in this paper. According to the best of our knowledge, utilizing computational intelligence techniques to predict the presence of a snow cover on PV panels with an hourly resolution solely based on the main meteorological parameters is performed for the first time in the literature. The output of these models can be used as an input for the PVPF stage and help to reduce PVPF errors in snow conditions by enabling the implementation of PVPF approaches compatible with the characteristics of snow-covered PV systems. The study is performed on the historical dataset of electrical and meteorological parameters of a PV system in Canada over 3 years. By applying 5-fold cross-validation and hyperparameter tuning, the best hourly snow cover prediction accuracy, 96%, has been obtained by the developed gradient boosting tree model. Testing this model on the unseen data of 2 other PV systems has resulted in 80% and 78% accuracy for snow cover prediction.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".