MétaCan
Menu
Back to cohort
Record W4411115380 · doi:10.1016/j.aei.2025.103526

Latent subdomain assignment based on pseudo domain labels for fault diagnosis of unseen data

2025· article· en· W4411115380 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueAdvanced Engineering Informatics · 2025
Typearticle
Languageen
FieldEngineering
TopicMachine Fault Diagnosis Techniques
Canadian institutionsUniversity of Ottawa
FundersChina Scholarship CouncilNational Natural Science Foundation of China
KeywordsDomain (mathematical analysis)Fault (geology)Computer scienceArtificial intelligenceAlgorithmData miningPattern recognition (psychology)MathematicsBiology

Abstract

fetched live from OpenAlex

Intelligent fault diagnosis (IFD) is important for rotating machinery maintenance. Unfortunately, fault diagnosis training models often degenerate if unknown domain shifts exist between different working conditions when performing IFD. To deal with this problem, more generalized features related to rolling element bearing faults should be explored so that the generalized capacity of the training model is boosted for unseen target domain data. In this paper, a new algorithm using pseudo domain labels is proposed to explore subdomain distributions within each subdomain at the domain level. The idea behind the proposed method is that the domain shifts caused by variable working conditions, like varying speeds, should also be considered since the data may show a dynamic distribution of temporal features that are not limited to spatial distributions. That is, the original domain distribution could be further divided into several latent subdomains by introducing pseudo domain labels, which enables the proposed method to learn domain specific features. Furthermore, the diversity of learned features across subdomains ensures comprehensive feature coverage during model training, while the inherent similarities between these domains enhance the capacity of the model for domain generalization. To figure out how the domain label updates, a domain-class label is initially introduced to facilitate fine-grained feature learning, enabling the model to capture as many features as possible. Then an adversarial learning strategy is employed to separate the domain and class information. Specifically, pseudo domain labels are determined using class invariant features, while class labels are distinguished using features that are invariant across multiple latent subdomains. These two steps are equivalent to a min–max game, like adversarial learning. By exploring features from the class and domain levels, the domain generalization capabilities of the model can be improved, thereby further increasing the accuracy of results. Experiments on two public bearing datasets show that the proposed method outperforms state-of-the-art methods. Additionally, by limiting the number of accessible data from known source domains, the proposed method shows the potential to maintain satisfactory domain generalization capacities when combined with few-shot learning.

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.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.486
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.010
GPT teacher head0.272
Teacher spread0.261 · 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