Kronecker convolutional feature pyramid for fault diagnosis in rolling bearings
Bibliographic record
Abstract
Rolling bearings play a significant role in rotating machinery. Due to the failure of these components, the operations of the whole machinery are compromised and get out of service, which ultimately causes significant workload overhead and monetary loss. Many techniques are proposed for the diagnosis of faults in the rolling bearing; these techniques are manual and require a large amount of time for identification and correction of faults, which is not suitable for routine maintenance and operability of this rotating machinery. Therefore, there is a need for promising techniques for autonomous and reliable fault diagnosis in rolling bearings. Furthermore, the proposed deep learning model for fault diagnosis is not able to provide efficient and reliable results and is vulnerable to degradation problems and lack of multi-scale feature extraction. This proposed model faces the issue of the degradation problem due to the disappearance of the gradient, which ultimately compromises the optimization process. To solve these issues above, the authors proposed a novel three-dimensional (3D) Kronecker convolution feature pyramid (KCFP), which efficiently inputs the acquired data without converting time-frequency domain and pixel loss. In our model, the single dilation rate is replaced by 3D Kronecker convolution, and 3D Feature Selection (3DFSC) is used for the local learning of features. The proposed research enhances feature representation and classification accuracy while mitigating model degradation. Authors evaluate the model on the Paderborn University and MFPT bearing datasets. KCFP achieves round (99.6%) classification accuracy, outperforming the MFF-DRN (98.6%) and standard CNN (97.5%) models for the Paderborn University dataset. KCFP achieves round (97.6%) classification accuracy, outperforming the MFF-DRN (97.0%) and standard CNN (95.7%) models for the MFPT dataset. These results demonstrate the potential of KCFP for reliable and efficient rolling bearing fault diagnosis in industrial applications.
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.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".