A Comparative Study of Dimensionality Reduction Methods for Accurate and Efficient Inverter Fault Detection in Grid-Connected Solar Photovoltaic Systems
Bibliographic record
Abstract
The continuous, effective operation of grid-connected photovoltaic (GCPV) systems depends on dependable inverter failure detection. Early, precise fault diagnosis improves general system dependability, lowers maintenance costs, and saves downtime. Although computing efficiency remains a difficulty, particularly in resource-limited contexts, machine learning-based fault detection presents interesting prospects in accuracy and responsiveness. By streamlining data complexity and allowing faster and more effective fault diagnosis, dimensionality reduction methods play vital role. Using dimensionality reduction and ML techniques, this work explores inverter fault detection in GCPV systems. Photovoltaic inverter operational data was normalized and preprocessed. In the next step, dimensionality reduction using Principal Component Analysis (PCA) and autoencoder-based feature extraction were explored. For ML training four classifiers which include Random Forest (RF), logistic regression (LR), decision tree (DT), and K-Nearest Neighbors (KNN) were used. Trained on the whole standardized dataset, the RF model routinely produced the greatest accuracy of 99.87%, so efficiently capturing complicated feature interactions but requiring large processing resources and time of 36.47sec. LR model showed reduction in accuracy, but very fast training time compared to other models. Further, PCA greatly lowered computing demands, especially improving inference speed for LR and KNN. High accuracy of 99.23% across all models was maintained by autoencoder-derived features.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 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.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".