A novel method for identifying sudden degradation changes in remaining useful life prediction for bearing
Bibliographic record
Abstract
This paper presents a novel approach to enhancing the accuracy of Remaining Useful Life (RUL) predictions for bearings, addressing the limitations of traditional methods that fail to capture sudden changes in bearing health states. Conventional methods often rely on the monotonicity of a single feature, such as root mean square (RMS), and are unable to continuously monitor health changes. To overcome these challenges, a prototypical network is employed to identify sudden changes in bearing health states, referred to as critical points in this paper. By comparing the health states at the current time and the initial time, the critical point can be determined through the results of the prototypical network. Once the critical point is identified, the hyperparameters of the prototypical network are fixed and transformed to enable RUL prediction. Consequently, RUL can be predicted following the critical point. Furthermore, the prototypical network updates the initial time and continuously analyses the vibration signal to determine the next critical point. This process repeats until no further signals are input. Moreover, validation on two public datasets demonstrates the effectiveness of the proposed method in improving RUL prediction accuracy. Results indicate that the proposed method enhances model precision in bearing RUL prediction through critical point detection (CPD). Incorporating CPD offers a novel perspective for RUL prediction in industrial bearing applications .
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 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".