MétaCan
Menu
Back to cohort
Record W3213620760 · doi:10.1155/2021/7346352

Intelligent Fault Diagnosis of Bearing Based on Convolutional Neural Network and Bidirectional Long Short‐Term Memory

2021· article· en· W3213620760 on OpenAlexfundno aff
Dazhang You, Linbo Chen, Fei Liu, YePeng Zhang, Wei Shang, Yameng Hu, Liu We

Bibliographic record

VenueShock and Vibration · 2021
Typearticle
Languageen
FieldEngineering
TopicMachine Fault Diagnosis Techniques
Canadian institutionsnot available
FundersNational Natural Science Foundation of ChinaUniversity of OttawaCase Western Reserve University
KeywordsBearing (navigation)Term (time)Convolutional neural networkFault (geology)Computer scienceLong short term memoryArtificial neural networkArtificial intelligenceRecurrent neural networkGeology

Abstract

fetched live from OpenAlex

The traditional bearing fault diagnosis methods have complex operation processes and poor generalization ability, while the diagnosis accuracy of the existing intelligent diagnosis methods needs to be further improved. Therefore, a novel fault diagnosis approach named CNN‐BLSTM for bearing is presented based on convolutional neural network (CNN) and bidirectional long short‐term memory (BLSTM) in this paper. This method directly takes the collected one‐dimensional raw vibration signal as input and adaptively extracts the feature information through CNN. Then, the BLSTM is used to fuse the extracted features to acquire the failure information sufficiently and prevent the model from overfitting. Finally, two different experimental datasets are used to verify the effectiveness of the method. The experimental results show that the proposed CNN‐BLSTM model can accurately diagnose the fault category of bearings. It has the advantages of rapidity, stability, antinoise, and strong generalization.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.014
GPT teacher head0.261
Teacher spread0.247 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations18
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueShock and VibrationSame topicMachine Fault Diagnosis TechniquesFrench-language works237,207