Multiple-Order Graphical Deep Extreme Learning Machine for Unsupervised Fault Diagnosis of Rolling Bearing
Bibliographic record
Abstract
The intelligent fault diagnosis powered deep learning (DL) is widely applied in various practical industries, but the conventional intelligent fault diagnosis methods cannot fully juggle the manifold structure information with multiple-order similarity from the massive unlabeled industrial data. Thus, a new Multiple-Order Graphical Deep Extreme Learning Machine (MGDELM) algorithm for unsupervised fault diagnosis (UFD) of rolling bearing is proposed in this study. Specifically, the developed MGDELM algorithm mainly contains two parts: 1) one is unsupervised multiple-order feature extraction, the first-order proximity with Cauchy graph embedded is applied to extract the local structural information, and the second-order proximity is simultaneously employed for mining global structural information and 2) the other used is the unsupervised Fuzzy-C-Mean (FCM) into fault clustering built on the extracted multiple-order graph embedding features. Empirically, two cases of rolling bearing failure data validate the effectiveness of the proposed algorithm and fault diagnosis method. By jointly optimizing the multiple-order objective function, the proposed MGDELM algorithm can synchronously extract local and global structural information from the raw industrial data. This study also provides a novel promising approach for UFD.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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.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".