Bearing Fault Feature Extraction and Fault Diagnosis Method Based on Feature Fusion
Bibliographic record
Abstract
Bearing is one of the most important parts of rotating machinery with high failure rate, and its working state directly affects the performance of the entire equipment. Hence, it is of great significance to diagnose bearing faults, which can contribute to guaranteeing running stability and maintenance, thus promoting production efficiency and economic benefits. Usually, the bearing fault features are difficult to extract effectively, which results in low diagnosis performance. To solve the problem, this paper proposes a bearing fault feature extraction method and it establishes a bearing fault diagnosis method that is based on feature fusion. The basic idea of the method is as follows: firstly, the time-frequency feature of the bearing signal is extracted through Wavelet Packet Transform (WPT) to form the time-frequency characteristic matrix of the signal; secondly, the Multi-Weight Singular Value Decomposition (MWSVD) is constructed by singular value contribution rate and entropy weight. The features of the time-frequency feature matrix obtained by WPT are further extracted, and the features that are sensitive to fault in the time-frequency feature matrix are retained while the insensitive features are removed; finally, the extracted feature matrix is used as the input of the Support Vector Machine (SVM) classifier for bearing fault diagnosis. The proposed method is validated by data sets from the time-varying bearing data from the University of Ottawa and Case Western Reserve University Bearing Data Center. The results show that the algorithm can effectively diagnose the bearing under the steady-state and unsteady state. This paper proposes that the algorithm has better fault diagnosis capabilities and feature extraction capabilities when compared with methods that aree based on traditional feature technology.
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.002 |
| 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.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".