Clustering-guided prototypical contrastive learning for bearing fault diagnosis under variable working conditions
Bibliographic record
Abstract
Abstract Methods based on deep learning for intelligent fault diagnosis have shown good results in general diagnostic tasks. Nevertheless, these methods largely depend on the sufficient labeled data, limiting their application in the actual scenarios where the availability of labeled data is limited. Moreover, the distribution of testing data is inconsistent with that of training data because bearings operate in various working conditions, leading to the performance degradation of these approaches. To tackle these two entangled problems, we propose a novel unsupervised domain adaptation network, which presents clustering-guided prototypical contrastive learning for cross-domain fault diagnosis. More specifically, k-means clustering is first used to aggregate similar source samples and target samples separately, acquiring the centroid of each cluster and the cluster index of each sample. Then, we propose in-domain and cross-domain contrastive learning strategies based on clustering results to achieve class alignment and domain alignment across source domain and target domain. By applying in-domain contrastive learning, we make the intra-class distance smaller while making the inter-class distance larger within each domain, effectively reducing the number of samples on the class boundaries. By applying cross-domain contrastive learning, class-to-class semantic similarity across two different domains is considered, which not only retains class discriminability in each domain but aligns these two domains at both the class level and the domain level. Detailed experiments on three bearing datasets reveal that our method outperforms in fault diagnosis across diverse working conditions, achieving average accuracy improvements of 2.10%, 7.44%, and 1.17% on the JNU, HUST, and Ottawa datasets, respectively.
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.001 | 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.001 |
| Scholarly communication | 0.001 | 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".