A Novel Fault Diagnosis Method Based on NEEEMD-RUSLP Feature Selection and BTLSTSVM
Bibliographic record
Abstract
The vibration signal of rolling bearings is a nonlinear and non-stationary signal, which is affected by the working condition change and background noise, and the reliability of traditional feature extraction methods and fault identification methods is low. In order to effectively extract feature vectors and improve the accuracy and reliability of fault identification, we propose a new fault diagnosis method based on noise eliminated ensemble empirical mode decomposition and robust unsupervised feature selection with local preservation (NEEEMD-RUSLP) and binary tree least squares twin support vector machine (BTLSTSVM). Firstly, NEEEMD is introduced to suppress background noise and decompose the vibration signal into a series of intrinsic mode functions (IMF), and the wavelet packet energy entropy, packet energy coefficient, and Gini coefficient of each IMF are extracted to construct time-frequency domain features. Then, 16 time-domain features and 13 frequency-domain features of the original signal are extracted and combined with the time-frequency domain features of each IMF to construct a high-dimensional feature space. In order to reduce the feature dimension and improve the diagnostic accuracy of the model, the RUSLP feature selection method is introduced to select effective low-dimensional features from the high-dimensional features. In addition, the binary tree (BT) strategy is introduced into the LSTSVM binary classifier to construct the BTLSTSVM multi-classifier, which aims to improve the recognition accuracy of low-dimensional features. In the bearing fault diagnosis of Case Western Reserve University, the fault diagnosis accuracy obtained by the proposed method is improved by 10.67%. In the bearing fault diagnosis of the University of Ottawa, the fault diagnosis accuracy obtained by the proposed method is improved by 10%. In the fault diagnosis of check valve in the actual industrial production environment, the fault diagnosis accuracy obtained by the proposed method is improved by 22%. The results show that the proposed method can not only effectively extract and select the low-dimensional fault characteristics of the bearing, but also achieve competitive fault diagnosis accuracy. Therefore, this method can provide a new method reference for the field of fault diagnosis, and has great theoretical significance and application value.
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.001 |
| 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".