An Efficient Neural Network-Based Method for Diagnosing Faults of PV Array
Bibliographic record
Abstract
This paper presents an efficient neural network-based method for fault diagnosis in photovoltaic arrays. The proposed method was elaborated on three main steps: the data-feeding step, the fault-modeling step, and the decision step. The first step consists of feeding the real meteorological and electrical data to the neural networks, namely solar irradiance, panel temperature, photovoltaic-current, and photovoltaic-voltage. The second step consists of modeling a healthy mode of operation and five additional faulty operational modes; the modeling process is carried out using two networks of artificial neural networks. From this step, six classes are obtained, where each class corresponds to a predefined model, namely, the faultless scenario and five faulty scenarios. The third step involves the diagnosis decision about the system’s state. Based on the results from the above step, two probabilistic neural networks will classify each generated data according to the six classes. The obtained results show that the developed method can effectively detect different types of faults and classify them. Besides, this method still achieves high performances even in the presence of noises. It provides a diagnosis even in the presence of data injected at reduced real-time, which proves its robustness.
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.000 |
| Bibliometrics | 0.001 | 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".