1
Return

CMCA: A cluster matching based class-incremental unsupervised domain adaptation method for bearing fault diagnosis

delete2026-08-05
delete0
PRE
AI
X
Xuejin Gao
Z
Zhuoyun Mu
H
Huihui Gao *
H
Huayun Han
杨宏燕 cover
杨宏燕 (Hongyan Yang)
Y
Yongsheng Qi
DOI:10.1016/j.neucom.2026.134717delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In variable-condition bearing fault diagnosis, target condition data often arrive incrementally over the bearing service lifecycle. To address this, we introduce a class-incremental unsupervised domain adaptation (CI-UDA) framework that jointly aligns domains under varying label spaces while preserving knowledge across incremental time steps. Existing sample-based shared class filtering and pseudo-label assignment methods overlook the uncertainties introduced by inter-domain differences and lack a holistic, class-level decision-making approach. This leads to inaccurate shared class identification, low-precision supervisory signals, and suboptimal solutions. This paper proposes cluster matching to address these issues. Our method first calibrates the source model’s latent space via augmented source domain training, then clusters target domain features, and optimally matches these clusters to class labels using a designed matching protocol. This provides clear, precise supervision signals for the target data. Our approach is validated on three datasets, achieving an average diagnostic accuracy exceeding 95% and outperforming existing methods.

Journal

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

B
beijing university of technology
Scholars:
4.3K
Papers: 1.5K
Citations: 0
I
inner mongolia university of technology
Scholars:
1.0K
Papers: 344
Citations: 0
Cited Papers

Cited Papers

Citing Papers

Citing Papers