Induction motor process monitoring in power plants based on multi‐step reconstruction‐based <scp>PCA</scp>
Bibliographic record
Abstract
Abstract Fault diagnosis of induction motors is crucial for enhancing the reliability of industrial processes. Reconstruction‐based principal component analysis (RB‐PCA) is commonly used in fault diagnosis for industrial equipment because it effectively solves the problem of smearing effects. However, RB‐PCA encounters challenges related to temporal inconsistency in the industrial processes. This issue arises in the early stages of a fault, where fault indicators fluctuate around the control threshold. Such oscillations can cause the model to switch intermittently between reconstruction and non‐reconstruction states, which diminishes diagnostic accuracy and model stability. This paper provides a multi‐step reconstruction‐based principal component analysis (MS‐RBPCA) algorithm that integrates a moving time window. Additionally, spatial distance reconstruction and sequence floating forward search are introduced to improve the computational efficiency of fault isolation. The effectiveness of the MS‐RBPCA is demonstrated through one simulation study and one industrial case involving fault samples from induction motors in a power plant. The results show that MS‐RBPCA can significantly reduce computational time, achieving a speed improvement of up to 50% while maintaining the fault detection rate above 97% and the false alarm rate below 1.5%, providing a viable solution for industrial process monitoring.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| 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.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".