Application of Hybrid Wavelet-SVM Algorithm to Detect Broken Rotor Bars in Induction Motors
Bibliographic record
Abstract
Induction motors are essential components in the modern manufacturing settings and can function continuously for hours without minor issues due to their reliability and construction. However, any fault in these types of machinery may result in extended downtime, costly maintenance, and safety issues. Consequently, advanced diagnostic methods that prevent possible failure by recognizing the early signs of deficiency can increase motors' reliability. In the past few years, researchers conducted many experiments to identify Broken Rotor Bars by integrating Motor Current Signal Analysis and Artificial Intelligence solutions. However, the motor may be subjected to load fluctuation, then oscillation related signatures exhibit similar behavior that of broken bar which leads misleading signatures. This overlapping frequencies, induced by Broken Rotor Bars and the Low-frequency Torque Oscillations (LTOs), can generate False Positive alarms and frustrates the diagnostic system. In this work, we propose a diagnostic algorithm to distinguish and disentangle the Broken Rotor Bar's frequencies from misleading LTOs, and detects Broken Rotor Bars by applying a Hybrid Wavelet-Support Vector Machines algorithm. The results verify the efficiency and reliability of our proposed algorithm compared to the existing methods.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 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".