Data-driven dictionary design–based sparse classification method for intelligent fault diagnosis of planet bearings
Bibliographic record
Abstract
Planet bearings have remained as the challenging components for health monitoring and diagnostics in the planetary transmission systems of helicopters and wind turbines, due to their intricate kinematic mechanisms, strong modulations, and heavy interferences from gear vibrations. To address intelligent diagnostics of planet bearings, this article presents a data-driven dictionary design–based sparse classification (DDD-SC) approach. DDD-SC is free of detecting the weak frequency features and can achieve reliable fault recognition performances for planet bearings without establishing any explicit classifiers. In the first step, DDD-SC implements the data-driven dictionary design with an overlapping segmentation strategy, which leverages the self-similarity features of planet bearing data and constructs the category-specific dictionaries with strong representation power. In the second step, DDD-SC implements the sparsity-based intelligent diagnosis with the sparse representation–based classification criterion and differentiates various planet bearing health states based on minimal sparse reconstruction errors. The effectiveness and superiority of DDD-SC for intelligent planet bearing fault diagnosis have been demonstrated with an experimental planetary transmission system. The extensive diagnosis results show that DDD-SC can achieve the highest diagnosis accuracy, strongest anti-noise performance, and lowest computation costs in comparison with three classical sparse representation–based classification and two advanced deep learning 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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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".