Ke Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ke Chen has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Kunjie Yu
Zhengzhou University
17 shared publications - Jing Liang
Zhengzhou University
14 shared publications - Caitong Yue
Zhengzhou University
11 shared publications - Boyang Qu
School of Automation and Electrical Engineering, Zhongyuan University of Technology, Zhengzhou, China
6 shared publications - Dezheng Zhang
School of Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China
5 shared publications - Fangfang Zhang
Victoria University of Wellington
5 shared publications
Latest Publications
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (16) , 1
A Two-Stage Fault Diagnosis Method for Joint Distribution Alignment via Supervised Contrastive Learning Pre-training
In fault diagnosis tasks, samples collected under different working conditions can lead to variations in the distribution of features extracted by deep learning model. This will lead to performance degradation and weak generalization ability when a model trained under a single working condition is applied to other conditions. Domain adaptation methods have been developed to tackle the domain shift. The majority of existing methods to fault diagnosis under variable conditions focus on aligning the distribution of source and target domains, while neglecting the domain shift mitigation capabilities of pretrained networks and often resulting in suboptimal intra-class alignment. To overcome these limitations, this study proposes a novel two-stage framework for cross-domain fault diagnosis, which integrates supervised contrastive learning pre-training with downstream joint distribution alignment (SCL-JDA). During the pre-training phase, the deep learning model is trained using a supervised contrastive learning strategy, making the extracted features more discriminative for different classes. In the downstream task processing, a pseudo-labeling method is designed to assign high-confidence pseudo-labels to the target domain so that it can participate in the training to increase the generalization ability of the model. The superiority of SCL-JDA are substantiated through a series of fault diagnosis-related experiments conducted on bearing datasets.
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (16) , 1
A Two-Stage Fault Diagnosis Method for Joint Distribution Alignment via Supervised Contrastive Learning Pre-training
In fault diagnosis tasks, samples collected under different working conditions can lead to variations in the distribution of features extracted by deep learning model. This will lead to performance degradation and weak generalization ability when a model trained under a single working condition is applied to other conditions. Domain adaptation methods have been developed to tackle the domain shift. The majority of existing methods to fault diagnosis under variable conditions focus on aligning the distribution of source and target domains, while neglecting the domain shift mitigation capabilities of pretrained networks and often resulting in suboptimal intra-class alignment. To overcome these limitations, this study proposes a novel two-stage framework for cross-domain fault diagnosis, which integrates supervised contrastive learning pre-training with downstream joint distribution alignment (SCL-JDA). During the pre-training phase, the deep learning model is trained using a supervised contrastive learning strategy, making the extracted features more discriminative for different classes. In the downstream task processing, a pseudo-labeling method is designed to assign high-confidence pseudo-labels to the target domain so that it can participate in the training to increase the generalization ability of the model. The superiority of SCL-JDA are substantiated through a series of fault diagnosis-related experiments conducted on bearing datasets.
- 3 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (5) , 3035-3048
A Dual-Surrogate Competition-Assisted Evolutionary Algorithm With Triggered Constraint First Search for Expensive Constrained Optimization
Expensive constrained optimization problems (ECOPs), which frequently arise in real-world engineering optimization, are often limited by the number of evaluations. Using surrogate-assisted evolutionary algorithms (EAs) to reduce computational costs is a common approach. However, surrogate model errors are inevitable and often mislead the search direction of EAs. Most existing algorithms overlook the inevitability of such errors and attempt to minimize them through techniques like data selection, which might be ineffective for problems with highly complex constraint and objective functions. Therefore, we propose a dual-surrogate competition assisted EA with triggered constraint-first search (DC-TCFS) for ECOPs, aiming to reduce the misleading effects of surrogate models on the evolutionary process. In this study, two surrogate models are used to assist local searches through competition, effectively mitigating the impact of errors from a single surrogate model. A triggered constraint-first search method is proposed to quickly identify a feasible solution for problems with complex constraints. Additionally, an adaptive sampling criterion is designed to guide the algorithm toward solutions that are more beneficial to the evolutionary process. Experimental results demonstrate that the proposed algorithm outperforms state-of-the-art methods across various benchmark problems, real-world problems and a motor design optimization problem, highlighting its effectiveness in solving ECOPs.
- 3 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (5) , 3035-3048
A Dual-Surrogate Competition-Assisted Evolutionary Algorithm With Triggered Constraint First Search for Expensive Constrained Optimization
Expensive constrained optimization problems (ECOPs), which frequently arise in real-world engineering optimization, are often limited by the number of evaluations. Using surrogate-assisted evolutionary algorithms (EAs) to reduce computational costs is a common approach. However, surrogate model errors are inevitable and often mislead the search direction of EAs. Most existing algorithms overlook the inevitability of such errors and attempt to minimize them through techniques like data selection, which might be ineffective for problems with highly complex constraint and objective functions. Therefore, we propose a dual-surrogate competition assisted EA with triggered constraint-first search (DC-TCFS) for ECOPs, aiming to reduce the misleading effects of surrogate models on the evolutionary process. In this study, two surrogate models are used to assist local searches through competition, effectively mitigating the impact of errors from a single surrogate model. A triggered constraint-first search method is proposed to quickly identify a feasible solution for problems with complex constraints. Additionally, an adaptive sampling criterion is designed to guide the algorithm toward solutions that are more beneficial to the evolutionary process. Experimental results demonstrate that the proposed algorithm outperforms state-of-the-art methods across various benchmark problems, real-world problems and a motor design optimization problem, highlighting its effectiveness in solving ECOPs.
- Open Access
- 29 December 2025
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 12 (1) , 48
An improved generalized evolutionary algorithm for constrained multimodal multiobjective optimization
- 29 December 2025
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 12 (1) , 48
Open AccessAn improved generalized evolutionary algorithm for constrained multimodal multiobjective optimization
- 25 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 306
A multi-channel signal fault diagnosis method based on dynamic weighted data fusion and multi-scale feature enhancement
- 25 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 306
A multi-channel signal fault diagnosis method based on dynamic weighted data fusion and multi-scale feature enhancement
- 3 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 302
An efficient evolutionary feature selection algorithm with divide-and-conquer strategy for classification
- 3 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 302
An efficient evolutionary feature selection algorithm with divide-and-conquer strategy for classification
- 1 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 37 (2) , 836-850
Modal Detection Informed Classification Evaluation via Ensemble Networks for Expensive Constrained Multimodal Optimization
The evaluation of objective and constraint involving expensive simulations or physical experiments with multiple optimal solutions is referred to as expensive constrained multimodal optimization problems (ECMMOPs). Under limited real function evaluations (FEs), it is challenging to find multiple optimal solutions accurately while satisfying constraints. To address these issues, this article studies a self-clustering particle swarm optimization algorithm with modal detection informed classification evaluation (MDICE) to solve ECMMOPs. To deal with multimodality, a surrogate-assisted self-clustering update mechanism is first designed to update individuals in each modality. Following that, a novel modal detection strategy is proposed based on the awareness of fitness landscapes to identify all potential modal seeds. For better utilization of FEs, a modality-guided classification evaluation strategy is designed to efficiently generate infilling samples for each constraint and modality. Moreover, to address the complex constraints, a surrogate-assisted feasibility search strategy is developed to quickly search for feasible solutions at a lower evaluation cost. Experimental results on 33 benchmark functions with various characteristics indicate that MDICE outperforms four state-of-the-art surrogate-assisted evolutionary algorithms.
- 1 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 37 (2) , 836-850
Modal Detection Informed Classification Evaluation via Ensemble Networks for Expensive Constrained Multimodal Optimization
The evaluation of objective and constraint involving expensive simulations or physical experiments with multiple optimal solutions is referred to as expensive constrained multimodal optimization problems (ECMMOPs). Under limited real function evaluations (FEs), it is challenging to find multiple optimal solutions accurately while satisfying constraints. To address these issues, this article studies a self-clustering particle swarm optimization algorithm with modal detection informed classification evaluation (MDICE) to solve ECMMOPs. To deal with multimodality, a surrogate-assisted self-clustering update mechanism is first designed to update individuals in each modality. Following that, a novel modal detection strategy is proposed based on the awareness of fitness landscapes to identify all potential modal seeds. For better utilization of FEs, a modality-guided classification evaluation strategy is designed to efficiently generate infilling samples for each constraint and modality. Moreover, to address the complex constraints, a surrogate-assisted feasibility search strategy is developed to quickly search for feasible solutions at a lower evaluation cost. Experimental results on 33 benchmark functions with various characteristics indicate that MDICE outperforms four state-of-the-art surrogate-assisted evolutionary algorithms.
- 10 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (8) , 5717-5729
A Multiform Framework for Multiobjective Feature Selection in Unbalanced Classification: Combining Oversampling and Cost-Sensitive Learning
Unbalanced classification problems have attracted significant academic attention due to their widespread existence in the real world. The lack of recognition accuracy of minority class samples and the “curse of dimensionality” are two major difficulties in unbalanced classification problems. Existing unbalanced classification methods run the risk of losing the original feature information and are prone to bias toward the majority class. Multiform optimization is famous for capturing useful knowledge from alternative forms to help solve the original task. Motivated by this, this article introduces a multiform evolutionary framework that addresses the issue of multiobjective feature selection in unbalanced classification scenarios. It aims to utilize the advanced experience of selecting features on balanced datasets to assist in the search for feature subsets that can more accurately identify minority classes on the original dataset. Specifically, a knowledge transfer strategy is proposed to draw on the search experience of the auxiliary task from the oversampled dataset to help the cost-sensitive learning task based on the original dataset jump out of the local optimum. In addition, an offspring repairing mechanism is proposed to filter redundant features by considering the frequency of selected features. Experimental results on 23 real-world benchmark datasets demonstrate that the proposed method can select fewer features and achieve better classification results compared to six state-of-the-art multiobjective feature selection algorithms and three classical oversampling algorithms. Furthermore, the difference in performance of four base classifiers is investigated through a series of comparative experiments.
- 10 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (8) , 5717-5729
A Multiform Framework for Multiobjective Feature Selection in Unbalanced Classification: Combining Oversampling and Cost-Sensitive Learning
Unbalanced classification problems have attracted significant academic attention due to their widespread existence in the real world. The lack of recognition accuracy of minority class samples and the “curse of dimensionality” are two major difficulties in unbalanced classification problems. Existing unbalanced classification methods run the risk of losing the original feature information and are prone to bias toward the majority class. Multiform optimization is famous for capturing useful knowledge from alternative forms to help solve the original task. Motivated by this, this article introduces a multiform evolutionary framework that addresses the issue of multiobjective feature selection in unbalanced classification scenarios. It aims to utilize the advanced experience of selecting features on balanced datasets to assist in the search for feature subsets that can more accurately identify minority classes on the original dataset. Specifically, a knowledge transfer strategy is proposed to draw on the search experience of the auxiliary task from the oversampled dataset to help the cost-sensitive learning task based on the original dataset jump out of the local optimum. In addition, an offspring repairing mechanism is proposed to filter redundant features by considering the frequency of selected features. Experimental results on 23 real-world benchmark datasets demonstrate that the proposed method can select fewer features and achieve better classification results compared to six state-of-the-art multiobjective feature selection algorithms and three classical oversampling algorithms. Furthermore, the difference in performance of four base classifiers is investigated through a series of comparative experiments.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (8) , 5758-5772
Objective-Constraint Correlation-Guided Evolutionary Direction Adaptive Adjustment for Expensive Constrained Optimization
For expensive constrained optimization problems (ECOPs), the evaluation of the objective and constraints are both expensive. Due to the low computational cost of the surrogate model and the excellent search capabilities of evolutionary algorithms, surrogate-assisted evolutionary algorithms (SAEAs) have become a popular approach for solving ECOPs. When solving ECOPs, the errors in the objective and constraint surrogates will inevitably mislead the direction of evolution, making it difficult to find feasible solutions and avoid local optima. To defeat this issue, we propose an SAEA capable of adjusting the evolutionary direction to search in the correct direction as much as possible. Specifically, the correlation between objective and constraint is first analyzed, and then adaptive adjustments are made based on this correlation to revise the evolutionary direction throughout the three stages of the evolutionary process. For reproduction, an offspring enhanced generation strategy is proposed to generate promising and diverse offspring. For sampling, a dynamic infill sampling criterion is designed to select the most suitable solutions for expensive evaluations, thereby accelerating convergence. Finally, an adaptive environment selection strategy is designed to choose parents with more potential for improvement. The proposed method is evaluated on commonly used benchmark test functions and four engineering examples, with experimental results indicating its superior performance compared to other advanced methods.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (8) , 5758-5772
Objective-Constraint Correlation-Guided Evolutionary Direction Adaptive Adjustment for Expensive Constrained Optimization
For expensive constrained optimization problems (ECOPs), the evaluation of the objective and constraints are both expensive. Due to the low computational cost of the surrogate model and the excellent search capabilities of evolutionary algorithms, surrogate-assisted evolutionary algorithms (SAEAs) have become a popular approach for solving ECOPs. When solving ECOPs, the errors in the objective and constraint surrogates will inevitably mislead the direction of evolution, making it difficult to find feasible solutions and avoid local optima. To defeat this issue, we propose an SAEA capable of adjusting the evolutionary direction to search in the correct direction as much as possible. Specifically, the correlation between objective and constraint is first analyzed, and then adaptive adjustments are made based on this correlation to revise the evolutionary direction throughout the three stages of the evolutionary process. For reproduction, an offspring enhanced generation strategy is proposed to generate promising and diverse offspring. For sampling, a dynamic infill sampling criterion is designed to select the most suitable solutions for expensive evaluations, thereby accelerating convergence. Finally, an adaptive environment selection strategy is designed to choose parents with more potential for improvement. The proposed method is evaluated on commonly used benchmark test functions and four engineering examples, with experimental results indicating its superior performance compared to other advanced methods.