MétaCan
Menu
Back to cohort
Record W4392548400 · doi:10.3390/app14062253

Improved Adversarial Transfer Network for Bearing Fault Diagnosis under Variable Working Conditions

2024· article· en· W4392548400 on OpenAlexaboutno aff
Jun Wang, Hosameldin Ahmed, Xuefeng Chen, Ruqiang Yan, Asoke K. Nandi

Bibliographic record

VenueApplied Sciences · 2024
Typearticle
Languageen
FieldEngineering
TopicMachine Fault Diagnosis Techniques
Canadian institutionsnot available
FundersNational Natural Science Foundation of China
KeywordsAdversarial systemComputer scienceFault (geology)Rotor (electric)Artificial intelligenceData miningDomain (mathematical analysis)Dual (grammatical number)Bearing (navigation)Metric (unit)Feature (linguistics)Machine learningPattern recognition (psychology)EngineeringMathematics

Abstract

fetched live from OpenAlex

Bearings are one of the critical components of rotating machinery, and their failure can cause catastrophic consequences. In this regard, previous studies have proposed a variety of intelligent diagnosis methods. Most existing bearing fault diagnosis methods implicitly assume that the training and test sets are from the same distribution. However, in real scenarios, bearings have been working in complex and changeable working environments for a long time. The data during their working processes and the data used for model training cannot meet this condition. This paper proposes an improved adversarial transfer network for fault diagnosis under variable working conditions. Specifically, this paper combines an adversarial transfer network with a short-time Fourier transform to obtain satisfactory results with the lighter network. Then, this paper employs a channel attention module to enhance feature fusion. Moreover, this paper designs a novel domain discrepancy hybrid metric loss to improve model transfer learning performance. Finally, this paper verifies the method’s effectiveness on three datasets, including dual-rotor, a Case Western Reserve University dataset and the Ottawa dataset. The proposed method achieves average accuracy, surpassing other methods, and shows better domain alignment capabilities.

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.905
Threshold uncertainty score0.735

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.019
GPT teacher head0.279
Teacher spread0.260 · 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 teacher head, 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

Citations4
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueApplied SciencesSame topicMachine Fault Diagnosis TechniquesFrench-language works237,207