A hybrid hidden Markov model towards fault detection of rotating components
Bibliographic record
Abstract
A robust hybrid hidden Markov model-based fault detection method is proposed to perform multi-state fault classification of rotating components. The approach presented in this paper enhances the performance of the standard hidden Markov model (HMM) for fault detection by performing a series of pre-processing steps. First, the de-noised time-scale signatures are extracted using wavelet packet decomposition of the vibration data. Subsequently, the Teager Kaiser energy operator is employed to demodulate the time-scale components of the raw vibration signatures, following which the condition indicators are calculated. Out of several possible condition indicators, only relevant features are selected using a decision tree. This pre-processing improves the sensitivity of condition indicators under multiple faults. A Gaussian mixing model-based hidden Markov model (HMM) is then employed for fault detection. The proposed hybrid HMM is an improvement over traditional HMM in that it achieves better separation of the feature space leading to more robust state estimation under multiple fault states and measurement noise scenarios. A simulation employing modulated signals and two experimental validation studies are presented to demonstrate the performance of the proposed method.
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.001 |
| Bibliometrics | 0.001 | 0.000 |
| 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.001 |
| 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".