Detecting bearing defects under high noise levels: A classifier fusion approach
Bibliographic record
Abstract
Automatic bearing fault diagnosis may be approached as a pattern recognition problem that allows for a significant reduction in the maintenance costs of rotating machines, as well as the early detection of potentially disastrous faults. When these systems employ real vibration data obtained from bearings artificially damaged, they have to cope with a very limited number of training samples. Moreover, an important issue that has been little investigated in the literature is the presence of noise, which disturbs the vibration signals, and how this affects the identification of bearing defects. In this paper, a new strategy based on the fusion of different Support Vector Machines (SVM) is proposed in order to reduce noise effect in bearing fault diagnosis systems. Each SVM classifier is designed to deal with a specific noise configuration and, when combined together - by means of the Iterative Boolean Combination (IBC) technique - they provide high robustness to different noise-to-signal ratio. In order to produce a high amount of vibration signals, considering different defect dimensions and noise levels, the BEAring Toolbox (BEAT) is employed in this work. Experiments indicate that the proposed strategy can significantly reduce the error rates, even in the presence of very noisy signals.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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.000 | 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 teacher head, 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".