Application of Time Synchronous Averaging, Spectral Kurtosis and Support Vector Machines for Bearing Fault Identification
Bibliographic record
Abstract
Condition monitoring of rolling elements bearings is investigated in this paper. Recently [12, 13], we have developed a diagnosis procedure that combines a signal processing tool, i.e. Time Synchronous Averaging (TSA), and a pattern recognition method, i.e. Support Vector Machines (SVM), for bearing fault detection and prediction. As the generalization performance of the SVM-boundaries was strongly affected by the signal transmission path, this paper is then concerned with the integration of Spectral Kurtosis (SK) analysis in the diagnosis procedure to improve efficiency in such cases. We validate the use of both Time Synchronous Averaging and Spectral Kurtosis analysis, as signal processing tools that will automatically highlight bearing defect frequencies in the envelope spectrum. Twenty-one features (rms, peak, crest factor, band spectral energy, etc...) are extracted from the envelope of signals obtained from these two analyses and are used in the learning scheme. Results show that the generalization performance is less affected by the signal transmission path and the faulty bearing location, thus demonstrating that the modified diagnosis procedure can actually find some underlying patterns that are common to each type of bearing failure. The case-dependency of the support decision tool can therefore be reduced.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 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".