Rong Cheng

Dr. Rong Cheng


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2025 in Biomimetics
Verified
Journal Article
Open access
PDF file
KQKun Qi
Kun Qi
KWKai Wei
Kai Wei
RCRong Cheng
Rong Cheng
GLGuangmin Liang
Guangmin Liang
JHJiashun Hu
Jiashun Hu
WWWangyu Wu
Wangyu Wu
In the field of industrial fault detection, accurate and timely fault identification is crucial for ensuring production safety and efficiency. Effective feature selection (FS) methods can significantly enhance detection performance in this process. However, the recently proposed Black-winged Kite Algorithm (BKA) tends to suffer from premature convergence and local optima when handling high-dimensional feature spaces. To address these limitations, this paper proposes an improved Black-winged Kite Algorithm (IBKA). This algorithm integrates two novel enhancement mechanisms: First, the Stagnation-Triggered Diversification Mechanism monitors the algorithm’s convergence state and applies mild perturbations to the worst-performing individuals upon detecting stagnation, effectively preventing traps in local optima. Second, the Adaptive Weak Guidance Mechanism employs a conditional elite guidance strategy during the late optimization phase to provide subtle directional guidance to underperforming individuals, thereby improving convergence efficiency. We comprehensively evaluated the proposed IBKA across 26 benchmark functions. Results demonstrate superior performance in solution quality, convergence speed, and robustness compared to the original BKA and other advanced meta-heuristics. Furthermore, fault detection applications on public datasets validate the practical applicability of the binary version of the IBKA (bIBKA), showcasing significant improvements in detection accuracy and reliability. Experimental results confirm that these enhancement mechanisms effectively balance exploration and exploitation capabilities while preserving algorithmic simplicity and computational efficiency.

1 May 2026 in Biomimetics
Verified
Journal Article
Open access
PDF file
RCRong Cheng
Rong Cheng
ZSZhiwei Sun
Zhiwei Sun
KQKun Qi
Kun Qi
WWWangyu Wu
Wangyu Wu
AXAnd Lingling Xu
And Lingling Xu
As multi-view datasets expand across diverse practical fields, feature selection (FS) has become an indispensable preparatory stage for machine learning models. Nevertheless, real-world multi-view data is often unlabeled and distributed among isolated clients, posing significant challenges to traditional centralized methods due to privacy concerns and communication constraints. Furthermore, existing centralized and federated approaches frequently suffer from entrapment in local optima and lack robust convergence guarantees. To address these issues, we propose Fed-MUFSHT, a federated framework for multi-view unsupervised FS (MUFS) that integrates tensor learning with a novel metaheuristic optimizer, Hierarchical-Cognitive Tianji’s Horse Racing Optimization (HC-THRO). Within the federated learning paradigm, Fed-MUFSHT follows a dual-stage local optimization process. Stage 1 applies HC-THRO, which integrates Hierarchical Competitive Learning and Adaptive Cognitive Mapping to simulate multi-level strategic competition and cognitive adaptation among individuals. This design enhances global exploration, adaptive learning, and fine-grained feature selection in high-dimensional spaces. Stage 2 employs a TL module based on canonical polyadic (CP) decomposition to perform missing-view imputation and refine latent representation learning. At the global level, a privacy-preserving aggregation strategy based on Normalized Mutual Information (NMI) and feature weights enables efficient model coordination without exposing raw data. Comparative experiments on several public benchmark datasets reveal that Fed-MUFSHT maintains clear advantages over strong competing methods, showing better optimization results together with more dependable convergence characteristics. The overall evidence suggests that the proposed approach is both robust and effective for distributed optimization tasks involving privacy protection.