journal article·2026-01-14

Supervised contrastive learning-based domain generalisation network for rotating machinery cross-domain fault diagnosis

Minglie Li, Hong Jiang, Xiangfeng Zhang

Publisher page

Abstract

In recent years, intelligent diagnosis models based on domain adaptation have been widely applied in the variable working condition scenarios of rotating machinery. However, the need to access the target domain data in advance limits the application of these models in practical application scenarios. To address this issue, a supervised contrastive learning-based domain generalisation network (SCLDGN) is proposed for cross-domain fault diagnosis of rotating machinery. A hybrid pooling spatial attention (HPSA) module is developed to refine the feature information extracted from the original vibration signal and match the mean and covariance of feature distributions across all source domains to achieve global alignment. Subsequently, class-discriminative features are learned by minimising the supervised contrastive loss, while intra-class compactness is enhanced via a class centre loss, thereby improving the reliability of predictions under unknown working conditions. Diagnostic cases from two experimental scenarios demonstrate the effectiveness and superiority of the proposed approach. The proposed method achieves outstanding classification accuracies of 85.87% and 87.81% on the PU bearing dataset and the SQI gearbox dataset, respectively.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Machine Fault Diagnosis Techniques · Anomaly Detection Techniques and Applications · Generative Adversarial Networks and Image Synthesis

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Xinjiang University

Funding

Tianshan Talent Training Program

References (57)

Show source-provided references
1. 10.1109/TII.2023.326285410.1109/TII.2023.3262854 ↗
2. 10.1016/j.egyai.2023.10031810.1016/j.egyai.2023.100318 ↗
3. 10.1109/TNNLS.2024.337644910.1109/TNNLS.2024.3376449 ↗
4. 10.1088/1361-6501/ad620310.1088/1361-6501/ad6203 ↗
5. 10.1088/1361-6501/acf39010.1088/1361-6501/acf390 ↗
6. 10.1016/j.measurement.2024.11590110.1016/j.measurement.2024.115901 ↗
7. 10.1016/j.ymssp.2025.11262410.1016/j.ymssp.2025.112624 ↗
8. 10.1109/TIM.2025.355200210.1109/TIM.2025.3552002 ↗
9. 10.1016/j.ymssp.2022.10899010.1016/j.ymssp.2022.108990 ↗
10. 10.1016/j.aei.2024.10261010.1016/j.aei.2024.102610 ↗
11. 10.1016/j.eswa.2023.12121610.1016/j.eswa.2023.121216 ↗
12. 10.1109/TIM.2021.308848910.1109/TIM.2021.3088489 ↗
13. 10.1016/j.ress.2024.10996410.1016/j.ress.2024.109964 ↗
14. 10.1109/TMECH.2022.316328910.1109/TMECH.2022.3163289 ↗
15. 10.1109/TII.2023.333736410.1109/TII.2023.3337364 ↗
16. 10.1016/j.neucom.2020.05.01410.1016/j.neucom.2020.05.014 ↗
17. 10.1016/j.ress.2023.10918810.1016/j.ress.2023.109188 ↗
18. 10.1109/TII.2021.307871210.1109/TII.2021.3078712 ↗
19. 10.1109/TIE.2023.324329310.1109/TIE.2023.3243293 ↗
20. 10.1109/TIM.2024.338129210.1109/TIM.2024.3381292 ↗
21. 10.1109/TIM.2025.354570310.1109/TIM.2025.3545703 ↗
22. 10.1109/TIM.2022.315231610.1109/TIM.2022.3152316 ↗
23. 10.1109/TIM.2022.319779210.1109/TIM.2022.3197792 ↗
24. 10.1016/j.knosys.2022.11000810.1016/j.knosys.2022.110008 ↗
25. 10.1177/1475921724125669010.1177/14759217241256690 ↗
26. 10.48550/arxiv.2108.1172610.48550/arxiv.2108.11726 ↗
27. 10.1109/TPAMI.2012.25610.1109/TPAMI.2012.256 ↗
28. 10.1016/j.aei.2023.10226210.1016/j.aei.2023.102262 ↗
29. 10.1177/1475921725133251710.1177/14759217251332517 ↗
30. 10.1016/j.aei.2024.10287810.1016/j.aei.2024.102878 ↗
31. 10.1109/TII.2023.334373510.1109/TII.2023.3343735 ↗
32. 10.1016/j.aei.2024.10270310.1016/j.aei.2024.102703 ↗
33. 10.1016/j.ress.2025.11085410.1016/j.ress.2025.110854 ↗
34. 10.1016/j.infrared.2024.10522310.1016/j.infrared.2024.105223 ↗
35. 10.1016/j.eswa.2024.12455110.1016/j.eswa.2024.124551 ↗
36. 10.1016/j.measurement.2025.11793710.1016/j.measurement.2025.117937 ↗
37. 10.1016/j.engappai.2025.11255910.1016/j.engappai.2025.112559 ↗
38. 10.1109/JSEN.2023.328404410.1109/JSEN.2023.3284044 ↗
39. 10.1109/TII.2024.335940910.1109/TII.2024.3359409 ↗
40. 10.1016/j.conengprac.2024.10590010.1016/j.conengprac.2024.105900 ↗
41. Khosla P, Teterwak P, Wang C, et al. Supervised contrastive learning. Adv Neural Inf Process Syst. 2020;33:18661–18673.
42. 10.1016/j.measurement.2022.11159410.1016/j.measurement.2022.111594 ↗
43. 10.23918/APSPA.2018.865958710.23918/APSPA.2018.8659587 ↗
44. 10.1016/j.buildenv.2022.10882110.1016/j.buildenv.2022.108821 ↗
45. Ioffe S, Szegedy C. Batch normalization: accelerating deep network training by reducing internal covariate shift. In: International conference on machine learning, pmlr Lille, France; 2015. p. 448–456.
46. 10.1109/TPAMI.2022.319554910.1109/TPAMI.2022.3195549 ↗
47. Choi S, Jung S, Yun H, et al. Robustnet: improving domain generalization in urban-scene segmentation via instance selective whitening. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition Nashville, TN, USA; 2021. p. 11580–11590.
48. 10.1007/978-3-319-49409-8_3510.1007/978-3-319-49409-8_35 ↗
49. Khosla P Teterwak P Wang C et al. Supervised contrastive learning. 2021. arXiv:2004.11362.
50. Tzeng E Hoffman J Zhang N et al. Deep domain confusion: maximizing for domain invariance arXiv preprint arXiv:1412.3474 2014.
51. Ganin Y, Ustinova E, Ajakan H, et al. Domain-adversarial training of neural networks. J Mach Learn Res. 2016;17(59):1–35.
52. Li D, Yang Y, Song Y-Z, et al. Learning to generalize: meta-learning for domain generalization. In: Proceedings of the AAAI conference on artificial intelligence New Orleans, LA, USA; 2018. Vol. 32.
53. 10.1109/ACCESS.2020.299431010.1109/ACCESS.2020.2994310 ↗
54. 10.1109/TIM.2022.315400010.1109/TIM.2022.3154000 ↗
55. 10.48550/arXiv.2104.0200810.48550/arXiv.2104.02008 ↗
56. Huang Z, Wang H, Xing EP, et al. Self-challenging improves cross-domain generalization. ECCV; 2020.
57. Sagawa S Koh PW Hashimoto TB et al. Distributionally robust neural networks for group shifts: on the importance of regularization for worst-case generalization arXiv abs/1911.08731 2019. d oi: ht tps://arx iv.org/abs/1911.08731