Simultaneously Low Rank and Group Sparse Decomposition for Rolling Bearing Fault Diagnosis
Bibliographic record
Abstract
Singular value decomposition (SVD) methods have aroused wide concern to extract the periodic impulses for bearing fault diagnosis. The state-of-the-art SVD methods mainly focus on the low rank property of the Hankel matrix for the fault feature, which cannot achieve satisfied performance when the background noise is strong. Different to the existing low rank-based approaches, we proposed a simultaneously low rank and group sparse decomposition (SLRGSD) method for bearing fault diagnosis. The major contribution is that the simultaneously low rank and group sparse (SLRGS) property of the Hankel matrix for fault feature is first revealed to improve performance of the proposed method. Firstly, we exploit the SLRGS property of the Hankel matrix for the fault feature. On this basis, a regularization model is formulated to construct the new diagnostic framework. Furthermore, the incremental proximal algorithm is adopted to achieve a stationary solution. Finally, the effectiveness of the SLRGSD method for enhancing the fault feature are profoundly validated by the numerical analysis, the artificial bearing fault experiment and the wind turbine bearing fault experiment. Simulation and experimental results indicate that the SLRGSD method can obtain superior results of extracting the incipient fault feature in both performance and visual quality as compared with the state-of-the-art methods.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 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".