Supervised Self-Encoder-Based Feature Learning Study for Fault Diagnosis of Variable Operating Condition Rotor Blade Systems
Bibliographic record
Abstract
When a steam turbine blade has cracks, fractures, or other flaws, the steam turbine’s operating circumstances will change the vibration characteristics of the blades, complicating the problem identification process. The important defect features are difficult to automatically and effectively extract from the recorded vibration signals. In this study, the input signal characteristics for a particular operating situation are used as labels to reconstruct a trained autoencoder utilizing a reverse error. The supervised autoencoder receives the fault features for various speed circumstances, which it then protectively maps to a series of reference condition features. The goal is to eliminate the disruption brought on by variations in fault feature values brought on by alterations in operating circumstances. The experimental findings demonstrate that this approach can more effectively convert feature sequences under various working situations and address the issue of fault feature distortion brought on by changes in working conditions. In addition, comparison of clustering visualization and accuracy of classification methods on data before and after commutation demonstrates that the proposed supervised autoencoder model can extract accurate classifiable features for fault classification.
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.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 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".