Diagnosis Tasks Research Articles

Cognitive Diagnosis Method via Q-Matrix-Embedded Neural Networks

Cognitive diagnosis is one of the essential components in intelligent education and aims to diagnose student’s skill or knowledge mastery based on their responses. Recently, with the development of artificial intelligence, some researchers have applied neural network methods to cognitive diagnosis. Although they achieved some success, they seemed to lack a certain basis for designing network structures and could not obtain a unified method for designing network structures. We propose a neural network method for cognitive diagnosis based on Q-matrix constraints, introducing the Q-matrix from traditional cognitive diagnosis to enhance the reliability and interpretability of the network structure. Specifically, our method is highly consistent with generalized deterministic inputs, the noisy “and” gate model (GDINA), and the network structure reflects the direct contribution of skills to answering questions correctly, as well as the indirect contribution of interactions between skills to answering questions correctly. Finally, extensive experiments on both simulated and real datasets demonstrated that our method achieved high accuracy and reliability, with a particularly notable performance on low-quality datasets. As the number of questions and skills increased, our approach exhibited greater robustness compared to the classical methods, highlighting its potential for broad applicability in cognitive diagnosis tasks.

Contrastive learning-enabled digital twin framework for fault diagnosis of rolling bearing

Abstract Rolling bearings are essential components in various industrial machines, and their failures can lead to significant downtime and maintenance costs. Traditional data-driven fault diagnosis methods often require extensive fault datasets for training, which may not always be available in critical industrial scenarios, limiting their practicality. Digital twins, virtual representations of physical entities reflecting their operational conditions, offer a promising solution for the fault diagnosis of rolling bearings with limited fault data. In this paper, we propose a novel digital twin-driven framework to address the challenge of limited training data in rolling bearing fault diagnosis. Firstly, a virtual bearing simulation model is used to generate the simulated data. Subsequently, a transformer-based network is introduced to learn the discrepancy features from the raw data. Then, a Maximum Mean Discrepancy loss and a supervised contrastive learning loss for raw and augmentation data are established to achieve global domain alignment and instance-based domain alignment. Finally, an unsupervised contrastive learning loss for the augmentation data of the target domain is established to further improve the diagnostic performance. In five cross-domain fault diagnosis tasks representing real industrial scenarios set in this study, the proposed method achieved an average diagnostic accuracy of 84.40%, exceeding two existing advanced domain adaptation methods by more than 10%. The experimental results demonstrate that the proposed method achieves high diagnostic performance in real industrial scenarios where labeled data is lacking. This shows its significant benefits for monitoring the condition of critical bearings.

Multidisciplinary Framework for Vibration-Based Gear Fault Diagnosis Using Experiments, Modeling, and Machine Learning

Vibration-based gear diagnosis is crucial for ensuring the reliability of rotating machinery, making the monitoring of gear health essential for preventing costly downtime and optimizing performance. This study proposes a multidisciplinary framework to enhance gear diagnosis, that aligns with the new era of digital twins by integrating experiments, dynamic modeling, physical preprocessing, and machine learning. Within this framework, we focus on three core procedures: domain adaptation to reduce discrepancies between measured data and synthetic data generated by dynamic models; physical preprocessing, grounded in in-depth investigations dictating signal processing and feature engineering techniques; and learning algorithms, encompassing the process of training AI-based models. We demonstrate this framework through a comprehensive case study of localized tooth fault diagnosis, using controlled-degradation tests and realistic simulations. First, we detect faults using unsupervised learning algorithms; then, we use zero-shot-learning for classifying between localized and distributed faults; finally, we adopt a one-shot-learning strategy for severity estimation. Above all, this hybrid framework bridges the gaps between physical-based and AI-based approaches by combining physical knowledge and advanced algorithmics with machine learning. This contributes to the PHM field by offering valuable insights into integrating different aspects of research, thereby enhancing performance in gear diagnosis tasks.

A Feature Fusion Model Based on Temporal Convolutional Network for Automatic Sleep Staging Using Single-Channel EEG.

Sleep staging is a crucial task in sleep monitoring and diagnosis, but clinical sleep staging is both time-consuming and subjective. In this study, we proposed a novel deep learning algorithm named feature fusion temporal convolutional network (FFTCN) for automatic sleep staging using single-channel EEG data. This algorithm employed a one-dimensional convolutional neural network (1D-CNN) to extract temporal features from raw EEG, and a two-dimensional CNN (2D-CNN) to extract time-frequency features from spectrograms generated through continuous wavelet transform (CWT) at the epoch level. These features were subsequently fused and further fed into a temporal convolutional network (TCN) to classify sleep stages at the sequence level. Moreover, a two-step training strategy was used to enhance the model's performance on an imbalanced dataset. Our proposed method exhibits superior performance in the 5-class classification task for healthy subjects, as evaluated on the SHHS-1, Sleep-EDF-153, and ISRUC-S1 datasets. This work provided a straightforward and promising method for improving the accuracy of automatic sleep staging using only single-channel EEG, and the proposed method exhibited great potential for future applications in professional sleep monitoring, which could effectively alleviate the workload of sleep technicians.

BrainMass: Advancing Brain Network Analysis for Diagnosis With Large-Scale Self-Supervised Learning.

Foundation models pretrained on large-scale datasets via self-supervised learning demonstrate exceptional versatility across various tasks. Due to the heterogeneity and hard-to-collect medical data, this approach is especially beneficial for medical image analysis and neuroscience research, as it streamlines broad downstream tasks without the need for numerous costly annotations. However, there has been limited investigation into brain network foundation models, limiting their adaptability and generalizability for broad neuroscience studies. In this study, we aim to bridge this gap. In particular, 1) we curated a comprehensive dataset by collating images from 30 datasets, which comprises 70,781 samples of 46,686 participants. Moreover, we introduce pseudo-functional connectivity (pFC) to further generates millions of augmented brain networks by randomly dropping certain timepoints of the BOLD signal; 2) we propose the BrainMass framework for brain network self-supervised learning via mask modeling and feature alignment. BrainMass employs Mask-ROI Modeling (MRM) to bolster intra-network dependencies and regional specificity. Furthermore, Latent Representation Alignment (LRA) module is utilized to regularize augmented brain networks of the same participant with similar topological properties to yield similar latent representations by aligning their latent embeddings. Extensive experiments on eight internal tasks and seven external brain disorder diagnosis tasks show BrainMass's superior performance, highlighting its significant generalizability and adaptability. Nonetheless, BrainMass demonstrates powerful few/zero-shot learning abilities and exhibits meaningful interpretation to various diseases, showcasing its potential use for clinical applications.

Comparison of Machine Learning Models and Feature Importance Investigation of Intelligent Fault Diagnosis Methods for Robots Based on Datasets Across Various Distributions

Intelligent fault detection is an important component of the industrial and automation fields. However, conventional research on intelligent fault detection mainly focuses on industrial production equipment, while there is little research on intelligent fault detection scenarios for robots. Based on a hexapod robot joints dataset, this paper investigates intelligent fault diagnosis tasks in the field of robotics. Firstly, the dataset is clustered into two new datasets with different distributions through k-means method, which is used to simulate the practicality of imbalanced distribution between healthy and fault data. Afterwards, several multioutput machine learning classification models were established to predict robot joints with faults. In two datasets with different distributions, the larger one is used as the training set and the smaller one is used as the testing set. The article compares the performance of these models with prediction accuracy as the main indicator. And based on the results, the paper selects the model with the highest accuracy for further exploration of feature importance. Finally, the article explains the significance of the results and analyzes possible reasons. The experimental results show that the random forest model better overcomes the problem of data distribution differences and has the highest accuracy. In the random forest model, the importance of position data representing position error is higher than that of slope with respect to the axis data representing angle error. This result may be related to the distribution of feature values and the fact that position data contains more crucial information.

Hybrid Feature Extraction for Breast Cancer Classification Using the Ensemble Residual VGG16 Deep Learning Model

Introduction: Breast Cancer (BC) is a significant cause of high mortality amongst women globally and probably will remain a disease posing challenges about its detectability. Advancements in medical imaging technology have improved the accuracy and efficiency of breast cancer classification. However, tumor features' complexity and imaging data variability still pose challenges. Method: This study proposes the Ensemble Residual-VGG-16 model as a novel combination of the Deep Residual Network (DRN) and VGG-16 architecture. This model is purposely engineered with maximal precision for the task of breast cancer diagnosis based on mammography images. We assessed its performance by accuracy, recall, precision, and the F1-Score. All these metrics indicated the high performance of this Residual-VGG-16 model. The diagnostic residual-VGG16 performed exceptionally well with an accuracy of 99.6%, precision of 99.4%, recall of 99.7%, F1 score of 98.6%, and Mean Intersection over Union (MIoU) of 99.8% with MIAS datasets. Result: Similarly, the INBreast dataset achieved an accuracy of 93.8%, a precision of 94.2%, a recall of 94.5%, and an F1-score of 93.4% Conclusion: The proposed model is a significant advancement in breast cancer diagnosis, with high accuracy and potential as an automated grading.

A Zn‐MOF With Its Mixed‐Matrix Membranes for Convenient and Efficient Visualization Detection of 3‐Nitrotyrosine Biomarker in Aqueous Media and Practical Application in Serum

ABSTRACTInstant and accurate detection of 3‐nitrotyrosine (3‐NT) biomarker is an important but challenging task in clinical diagnosis, treatment, and monitoring of diseases. Herein, this work reported a Zn (II)–based metal–organic framework (MOF) {[Zn2(BDPT)(DIMB)]}n, denoted as Zn‐BDPT, synthesized by solvothermal method using bis(3,5‐dicarboxyphenyl)terephthalamide (H4BDPT) and 1,4‐di(1H‐imidazol‐1‐yl)butane (DIMB). Neighboring [Zn (COO)2] clusters were connected by BDPT4− units and DIMB to form a (2,4,4)‐connected three‐dimensional (3D) architecture. X‐ray powder diffraction (PXRD) and thermogravimetric (TGA) experiments indicated that Zn‐BDPT had good purity and stability. Zn‐BDPT could selectively and rapidly recognize 3‐NT in an aqueous environment. For rapid economic detection of 3‐NT in actual samples, mixed‐matrix membranes (MMMs) based on Zn‐BDPT were successfully prepared and named Zn‐BDPT@PMMA. The addition of 3‐NT under the UV lamp displayed an evident visible fluorescence quenching effect. Quantitative titration analysis of Zn‐BDPT@PMMA in real serum sample obtained the Ksv value of 1.13 × 104 M−1 and a limit of detection (LOD) of 0.17 μM. This report demonstrated that MOF‐based MMMs could be used as ideal candidate for luminescent probe in actual application.

A Pseudo-Labeling Multi-Screening-Based Semi-Supervised Learning Method for Few-Shot Fault Diagnosis

In few-shot fault diagnosis tasks in which the effective label samples are scarce, the existing semi-supervised learning (SSL)-based methods have obtained impressive results. However, in industry, some low-quality label samples are hidden in the collected dataset, which can cause a serious shift in model training and lead to the performance of SSL-based method degradation. To address this issue, the latest prototypical network-based SSL techniques are studied. However, most prototypical network-based scenarios consider that each sample has the same contribution to the class prototype, which ignores the impact of individual differences. This article proposes a new SSL method based on pseudo-labeling multi-screening for few-shot bearing fault diagnosis. In the proposed work, a pseudo-labeling multi-screening strategy is explored to accurately screen the pseudo-labeling for improving the generalization ability of the prototypical network. In addition, the AdaBoost adaptation-based weighted technique is employed to obtain accurate class prototypes by clustering multiple samples, improving the performance that deteriorated by low-quality samples. Specifically, the squeeze and excitation block technique is used to enhance the useful feature information and suppress non-useful feature information for extracting accuracy features. Finally, three well-known bearing datasets are selected to verify the effectiveness of the proposed method. The experiments illustrated that our method can receive better performance than that of the state-of-the-art methods.

A rolling bearing fault signal denoising algorithm that combines a new adaptive information entropy with a new wavelet threshold function

Abstract Mechanical fault diagnosis is of great significance to industrial automation, and extracting vibration fault signals is one of the important tasks in mechanical health monitoring and fault diagnosis. However, due to the complex working environment of rolling bearings, a large amount of noise makes it difficult to extract vibration fault signals. Denoising the vibration signal of bearings can remove interference noise, simplify the early identification of signal features, and thus improve diagnostic accuracy and mechanical maintenance efficiency. This paper proposes a rolling bearing fault signal denoising algorithm, which constructs a new feature extraction and denoising function. This method first decomposes the noisy signal into Intrinsic Mode Functions (IMFs) by Intrinsic Computing Expressive Empirical Mode Decomposition with Adaptive Noise (ICEEMDAN). Secondly, a new adaptive information entropy threshold function is constructed to extract the noisy IMFs from it. Then, the noisy IMF signal is denoised by a new wavelet threshold function. Finally, the noise-free IMFs are reconstructed to reconstruct the denoised signal. To verify the actual performance of the algorithm, comparative experiments were conducted on a self-collected dataset and a public dataset, the results show that this method improves the continuity of signal reconstruction and can remove various types of vibration fault noise signals more effectively and accurately, \hl{thereby improving the fault detection accuracy by 2%-9%.

A dual-branch convolutional neural network with domain-informed attention for arrhythmia classification of 12-lead electrocardiograms

The automatic classification of arrhythmia is an important task in the intelligent auxiliary diagnosis of an electrocardiogram. Its efficiency and accuracy are vital for practical deployment and applications in the medical field. For the 12-lead electrocardiogram, we know that the comprehensive utilization of lead characteristics is key to enhancing diagnostic accuracy. However, existing classification methods (1) neglect the similarities and differences between the limb lead group and the precordial lead group; (2) the commonly adopted attention mechanisms struggle to capture the domain characteristics in an electrocardiogram. To address these issues, we propose a new dual-branch convolutional neural network with domain-informed attention, which is novel in two ways. First, it adopts a dual-branch network to extract intra-group similarities and inter-group differences of limb and precordial leads. Second, it proposes a domain-informed attention mechanism to embed the critical domain knowledge of electrocardiogram, multiple RR (R wave to R wave) intervals, into coordinated attention to adaptively assign attention weights to key segments, thereby effectively capturing the characteristics of the electrocardiogram domain. Experimental results show that our method achieves an F1-score of 0.905 and a macro area under the curve of 0.936 on two widely used large-scale datasets, respectively. Compared to state-of-the-art methods, our method shows significant performance improvements with a drastic reduction in model parameters.

Asynchronous Functional Brain Network Construction with Spatiotemporal Transformer for MCI Classification.

Construction and analysis of functional brain networks (FBNs) with resting-state functional magnetic resonance imaging (rs-fMRI) is a promising method to diagnose functional brain diseases. Nevertheless, the existing methods suffer from several limitations. First, the functional connectivities (FCs) of the FBN are usually measured by the temporal co-activation level between rs-fMRI time series from regions of interest (ROIs). While enjoying simplicity, the existing approach implicitly assumes simultaneous co-activation of all the ROIs, and models only their synchronous dependencies. However, the FCs are not necessarily always synchronous due to the time lag of information flow and cross-time interactions between ROIs. Therefore, it is desirable to model asynchronous FCs. Second, the traditional methods usually construct FBNs at individual level, leading to large variability and degraded diagnosis accuracy when modeling asynchronous FBN. Third, the FBN construction and analysis are conducted in two independent steps without joint alignment for the target diagnosis task. To address the first limitation, this paper proposes an effective sliding-window-based method to model spatiotemporal FCs in Transformer. Regarding the second limitation, we propose to learn common and individual FBNs adaptively with the common FBN as prior knowledge, thus alleviating the variability and enabling the network to focus on the individual disease-specific asynchronous FCs. To address the third limitation, the common and individual asynchronous FBNs are built and analyzed by an integrated network, enabling end-to-end training and improving the flexibility and discriminativity. The effectiveness of the proposed method is consistently demonstrated on three data sets for mild cognitive impairment (MCI) diagnosis.

Dynamic Temporal Denoise Neural Network with Multi-Head Attention for Fault Diagnosis Under Noise Background

Fault diagnosis plays a crucial role in maintaining the operational safety of mechanical systems. As intelligent data-driven approaches evolve, deep learning (DL) has emerged as a pivotal technique in fault diagnosis research. However, the collected vibrational signals from mechanical systems are usually corrupted by unrelated noises due to complicated transfer path modulations and component coupling. To solve the above problems, this paper proposed the dynamic temporal denoise neural network with multi-head attention (DTDNet). Firstly, this model transforms one-dimensional signals into two-dimensional tensors based on the periodic self-similarity of signals, employing multi-scale two-dimensional convolution kernels to extract signal features both within and across periods. Secondly, for the problem of lacking denoising structure in traditional convolutional neural networks, a temporal variable denoise (TVD) module with dynamic nonlinear processing is proposed to filter the noises. Lastly, a multi-head attention fusion (MAF) module is used to weight the denoted features of signals with different periods. Evaluation on two datasets, Case Western Reserve University bearing dataset (single sensor) and Real aircraft sensor dataset (multiple sensors), demonstrates that the DTDNet can reduce the useless noises in signals and achieve a remarkable improvement in classification performance compared with the state-of-the-art method. DTDNet provides a high-performance solution for potential noise that may occur in actual fault diagnosis tasks, which has important application value.

LMCD-OR: a large-scale, multilevel categorized diagnostic dataset for oral radiography

In recent years, digital dentistry has increasingly utilized advanced image analysis techniques, such as image classification and disease diagnosis, to improve clinical outcomes. Despite these advances, the lack of comprehensive benchmark datasets is a significant barrier. To address this gap, our research team develop LMCD-OR, a substantial collection of oral radiograph images designed to support extensive artificial intelligence (AI)-driven diagnostics. LMCD-OR comprises 3,818 digital imaging and communications in medicine (DICOM) oral X-ray images from local medical institutions that are meticulously annotated to provide broad category information for both primary dental outpatient services and detailed secondary disease diagnoses. This dataset is engineered to train and validate multiclassification models to improve the precision and scope of oral disease diagnostics. To ensure robust dataset validation, we employ four cutting-edge visual neural network classification models as benchmarks. These models are tested against rigorous performance metrics, demonstrating the ability of the dataset to support advanced image classification and disease diagnosis tasks. LMCD-OR is publicly available at http://dentaldataset.zeroacademy.net.

Approximating decision trees with priority hypotheses

This paper addresses the problem of creating decision trees for identifying hypotheses, also known as entities, in a setting where the cost of an action is dependent on the true hypothesis. Specifically, we consider the scenario where n hypotheses are divided into m groups based on their priority levels. Taking an action on a higher priority hypothesis incurs a higher cost. This is relevant to many real-world applications where cost-sensitive decisions need to be made. For example, in a medical diagnosis task, the goal is to take a series of actions (such as medical tests) to identify a cause. Each action in this process requires conducting a test on the patient and observing the outcome, which can take anywhere from a few minutes to several weeks depending on the test. In this case, the cost (the result of waiting for the outcome) is higher if the true hypothesis is more time-sensitive. For example, if the true hypothesis is toxic chemical exposure (as opposed to a chronic disease such as diabetes), a delay of a few minutes could significantly increase the patient's risk of mortality. We propose a group greedy algorithm to solve this problem. We demonstrate that under worst-case scenarios, our algorithm has an approximation ratio of O(mlog⁡n). Importantly, when m=1, meaning there is only one group of hypotheses, our result is consistent with the logarithmic approximation bound for the traditional optimal decision tree problem.

Deep Reinforcement Learning for personalized diagnostic decision pathways using Electronic Health Records: A comparative study on anemia and Systemic Lupus Erythematosus

Background:Clinical diagnoses are typically made by following a series of steps recommended by guidelines that are authored by colleges of experts. Accordingly, guidelines play a crucial role in rationalizing clinical decisions. However, they suffer from limitations, as they are designed to cover the majority of the population and often fail to account for patients with uncommon conditions. Moreover, their updates are long and expensive, making them unsuitable for emerging diseases and new medical practices. Methods:Inspired by guidelines, we formulate the task of diagnosis as a sequential decision-making problem and study the use of Deep Reinforcement Learning (DRL) algorithms to learn the optimal sequence of actions to perform in order to obtain a correct diagnosis from Electronic Health Records (EHRs), which we name a diagnostic decision pathway. We apply DRL to synthetic yet realistic EHRs and develop two clinical use cases: Anemia diagnosis, where the decision pathways follow a decision tree schema, and Systemic Lupus Erythematosus (SLE) diagnosis, which follows a weighted criteria score. We particularly evaluate the robustness of our approaches to noise and missing data, as these frequently occur in EHRs. Results:In both use cases, even with imperfect data, our best DRL algorithms exhibit competitive performance compared to traditional classifiers, with the added advantage of progressively generating a pathway to the suggested diagnosis, which can both guide and explain the decision-making process. Conclusion:DRL offers the opportunity to learn personalized decision pathways for diagnosis. Our two use cases illustrate the advantages of this approach: they generate step-by-step pathways that are explainable, and their performance is competitive when compared to state-of-the-art methods.

Nuclei Detection and Segmentation of Histopathological Images Using a Feature Pyramidal Network Variant of a Mask R-CNN.

Cell nuclei interpretation is crucial in pathological diagnostics, especially in tumor specimens. A critical step in computational pathology is to detect and analyze individual nuclear properties using segmentation algorithms. Conventionally, a semantic segmentation network is used, where individual nuclear properties are derived after post-processing a segmentation mask. In this study, we focus on showing that an object-detection-based instance segmentation network, the Mask R-CNN, after integrating it with a Feature Pyramidal Network (FPN), gives mature and reliable results for nuclei detection without the need for additional post-processing. The results were analyzed using the Kumar dataset, a public dataset with over 20,000 nuclei annotations from various organs. The dice score of the baseline Mask R-CNN improved from 76% to 83% after integration with an FPN. This was comparable with the 82.6% dice score achieved by modern semantic-segmentation-based networks. Thus, evidence is provided that an end-to-end trainable detection-based instance segmentation algorithm with minimal post-processing steps can reliably be used for the detection and analysis of individual nuclear properties. This represents a relevant task for research and diagnosis in digital pathology, which can improve the automated analysis of histopathological images.

Automated fault diagnosis of rotating machinery using sub domain greedy Network Architecture search

Network Architecture Search (NAS) automates hyperparameter adjustments in deep learning models, offering a potent solution for building intelligent fault diagnosis models. Despite its potential, NAS faces challenges in this application. The primary issues include the excessive time required when searching across the full data domain and the inefficacy of the common random search strategy in yielding high-performance sub networks. This study addresses these challenges through several key initiatives: It defines a specific library of hyperparameters tailored for intelligent fault diagnosis tasks; constructs sub data domain model clusters to reduce the computational costs associated with NAS; and introduces a hyperparameter search strategy leveraging a greedy algorithm, which enhances the search efficiency for optimal diagnostic sub network and minimizes its prediction errors. When applied to datasets involving gear and bearing faults, the proposed method demonstrates a reduction in both the time cost of searches and the prediction errors of sub networks, compared to traditional Network Architecture Search. Moreover, it outperforms manually tuned deep learning models by simultaneously optimizing multiple sets of hyperparameter and automatically generating higher accuracy diagnostic sub networks.

Multisource partial domain adaptation for bearing fault diagnosis

Abstract Domain adaptation has been widely used in fault diagnosis and dealt with data distribution discrepancies, but the labels in source and target domains are usually assumed to be identical. The complexity of the working conditions, in reality, leads to the fact that the labels in target domains are often a subset of the labels in source domains. This special case is called the partial domain problem. However, most of the existing proposed methods for solving partial domain problems are limited to single-source-domain scenarios and fail to effectively integrate multisource knowledge. Hence, this study proposes a new approach of multisource domain obfuscation-subdomain alignment (MSDO-SA) for partial domain adaptation fault diagnosis in multisource domains. Through domain obfuscation, the multisource domains are converted into a single source domain. The subdomain alignment aims at improving the generalization ability and relevance of the model, and effectively alleviates the domain shift problem. Finally, multiple partial domain fault diagnosis tasks using the CWRU dataset validate the effectiveness, robustness, and superiority of the proposed method.

Domain expansion fusion single-domain generalization framework for mechanical fault diagnosis under unknown working conditions

In real industrial scenarios, mechanical systems often adjust working conditions based on specific tasks, leading to challenges in collecting data for all possible machine states in advance. Consequently, applying deep learning models trained on data from a single working condition directly to other unknown working condition poses a significant challenge. To tackle this issue, a novel domain expansion fusion single-domain generalization framework is proposed for machinery fault diagnosis under unknown working conditions. Firstly, a domain expansion module that can be controlled via a constraint function is developed to create expanded domains that generate samples with controlled differences from the source domain. Subsequently, a dual-branch feature fusion network is proposed in the feature extraction module. It combines two distinct feature extractors and employs a weighted average fusion strategy to extract discriminative features. Additionally, a state recognition module is implemented through a multi-classifier ensemble strategy to enhance the robustness and accuracy of health state identification. Lastly, an adversarial contrastive training strategy is employed to optimize the network and enhance its generalization capabilities and fault diagnosis performance. Through case studies conducted on two mechanical fault datasets, the proposed method demonstrates good diagnosis performance on single-domain generalized diagnosis tasks with an average accuracy of 87.53%. Its generalization effect is validated. Furthermore, the comparison and ablation experiment results confirm the effectiveness and superior performance of the proposed intelligent fault diagnosis method in scenarios with unknown working conditions with an average accuracy improvement of at least 3.94%.