An AVMD-DBN-ELM Model for Bearing Fault Diagnosis
Bibliographic record
Abstract
Rotating machinery often works under complex and variable working conditions; the vibration signals that are widely used for the health monitoring of rotating machinery show extremely complicated dynamic frequency characteristics. It is unlikely that a few certain frequency components are used as the representative fault signatures for all working conditions. Aiming at a general solution, this paper proposes an intelligent bearing fault diagnosis method that integrates adaptive variational mode decomposition (AVMD), mode sorting based deep belief network (DBN) and extreme learning machine (ELM). It can adaptively decompose non-stationery vibration signals into temporary frequency components and sort out a set of effective frequency components for online fault diagnosis. For online implementation, a similarity matching method is proposed, which can match the online-obtained frequency-domain fault signatures with the historical fault signatures, and the parameters of AVMD-DBN-ELM model are set to be the same as the most similar case. The proposed method can decompose vibration signals into different modes adaptively and retain effective modes, and it can learn from the idea of an attention mechanism and fuse the results according to the weight of MIV. It also can improve the timeliness of the fault diagnosis. For comprehensive verification of the proposed method, the bearing dataset from the University of Ottawa is used, and some recent methods are repeated for comparative analysis. The results can prove that our proposed method has higher reliability, higher accuracy and higher efficiency.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".