An Enhanced Modeling Framework for Bearing Fault Simulation and Machine Learning-Based Identification With Bayesian-Optimized Hyperparameter Tuning
Bibliographic record
Abstract
Abstract Monitoring the condition of rotating machinery offers a salient tool for predictive maintenance of rolling elements subjected to continuous working loads, wear, fatigue, and degradation. In this study, an enhanced computational tool for bearing fault simulation and feature extraction is proposed. A subsequent identification scheme is realized, through Bayesian optimization of hyperparameters, including support vector classifier (SVC), gradient boosting (GBoost), random forest (RF), extreme gradient boosting (XBoost), light gradient boosting machine (LightGBM), and categorical boosting (CatBoost). The proposed hyperparameter optimization technique stands out from traditional methods by offering a more informed and efficient pathway to optimal performance in predictive maintenance. By using Bayesian optimization for hyperparameter tuning of machine learning models, which has not been extensively explored in this field, our approach shows significant advancements. Typical instances of bearing faults like inner race, outer race, and ball faults are considered. The analysis relies on the extraction of statistical and engineering characteristics from the collected response signals, including kurtosis, root mean square, peak, and ridge factor. Highly influential variables are highlighted on the basis of feature selection and importance algorithms, allowing bearing fault classification. We demonstrate that SVC and LightGBM produce over 97% of accuracy at low computational cost. This approach constitutes a robust and scalable framework for similar applications in engineering diagnostics.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".