An optimized GRNN‐enabled approach for power transformer fault diagnosis
Bibliographic record
Abstract
This article presents an innovative approach for fault diagnosis based on an optimized generalized regression neural network (GRNN) by integrating with dissolved gas analysis, cuckoo search algorithm (CSA), and rough set theory (RS). In the proposed method, the high dimensioned data will be simplified and reduced by RS to generate better features or attributes for the GRNN input. Meanwhile, to enhance the network performance, the smoothing factor of GRNN is optimized by CSA with Levy flight, which leads to a good global convergence. As a consequence, CSA can provide a good solution to effectively improve the fault diagnosis performance. To validate and demonstrate the proposed method, we applied it to a real‐world fault diagnosis application, power transformer fault diagnosis, by comparing the results with those of other methods. From the experimental results obtained from the evaluation, it is obvious that the proposed fault diagnosis method enabled with RS‐CSA‐GRNN can provide a useful solution for power transformer fault diagnosis because it outperformed other GRNN‐based methods that deployed different optimizing algorithms such as the particle swarm optimization and genetic algorithm. © 2019 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.
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.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".