Identification of time-frequency maps of bearing faults based on hyperparameter optimization SSA-GoogleNet
Bibliographic record
Abstract
In order to solve the problem of poor noise immunity of neural network in bearing fault detection and to meet the high demand for adaptive extraction ability of network features in the industrial field, this paper proposes a hyper-parameter optimization method to eliminate the error of human-set parameters. Aiming at the non-smoothness and non-linear characteristics of the bearing fault signal, the two-dimensional wavelet transform (2DWT) is used to extract the feature values of the vibration signal of the bearing fault, and it is proposed to use the CNN convolutional neural network (CNN) to train the fault model. Convolutional Neural Network (CNN) is proposed to be used for fault model training. Firstly, the 2D wavelet transform is applied to the bearing vibration signal to extract the time-frequency map of the vibration signal; secondly, the extracted time-frequency map is used as the training object of the convolutional neural network to train the model, and then multiple convolutional neural network frameworks are used for noise immunity test by adding Gaussian white noise to the original signal to construct the test framework, and then the framework with the best noise immunity is used as the base network; and then the CNN is used as the base network. Sparrow Search Algorithm (SSA), Grey Wolf Optimizer (GWO), and Whale Optimization Algorithm (GWO) to find the best parameters. Validated by the public dataset of Western Reserve University, the method can effectively improve the fault identification accuracy of the model and can get rid of the problem of poor network robustness.
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.001 |
| Meta-epidemiology (narrow) | 0.002 | 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.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".