Baohang Zhang

Dr. Baohang Zhang

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
7 June 2024 in Information Sciences
Verified
Journal Article
Open access
BZBaohang Zhang
Baohang Zhang
ZWZiqian Wang
Ziqian Wang
HLHaotian Li
Haotian Li
Zhenyu LeiZhenyu Lei
Zhenyu Lei
JCJiujun Cheng
Jiujun Cheng
Shangce GaoShangce Gao
Shangce Gao

9 May 2023 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
HLHaotian Li
Haotian Li
Haichuan YangHaichuan Yang
Haichuan Yang
BZBaohang Zhang
Baohang Zhang
HZHan Zhang
Han Zhang
Shangce GaoShangce Gao
Shangce Gao
Using sparrow search hunting mechanism to improve water wave algorithm (WWOSSA), which combines the water wave optimization (WWO) algorithm and the sparrow search algorithm (SSA), has good optimization ability and fast convergence speed. However, it still suffers from insufficient exploration ability and is easy to fall into local optimum. In this study, we propose a new algorithm for distributed population structure, called swarm exploration mechanism-based distributed water wave optimization (DWSA). In DWSA, an information exchange component and an optimal individual evolution component are designed to improve information exchange between individuals. This multi-part information interaction and distributed population structure algorithm can help the population algorithm to establish a balance between exploitation and exploration more effectively. We contrast DWSA with the original algorithms WWOSSA and other meta-heuristics in order to show the effectiveness of DWSA. The test set consists of 22 actual optimization issues from the CEC2011 set and 29 benchmark functions from the CEC2017 benchmark functions. In addition, an experimental comparison of the parameter values introduced in DWSA is included. According to experimental results, the proposed DWSA performs substantially better than its competitors. Assessments of the population diversity and landscape search trajectory also confirmed DWSA’s outstanding convergence.

27 November 2025 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
ZXZhe Xu
Zhe Xu
BZBaohang Zhang
Baohang Zhang
JYJiatianyi Yu
Jiatianyi Yu
LYLin Yang
Lin Yang
FYFenggang Yuan
Fenggang Yuan
Shangce GaoShangce Gao
Shangce Gao
Feature selection (FS) is a critical preprocessing step that enhances classification performance while reducing computational cost and overfitting. Among various evolutionary algorithms, the artificial bee colony (ABC) algorithm shows promising performance for FS tasks. However, existing ABC-based FS methods often suffer from duplicate individuals in the population. These duplicates waste computational resources, slow convergence, and reduce population diversity. Complex feature interactions further compound these challenges and the risk of premature convergence, making it difficult to maintain an effective balance between exploration and exploitation. To address these limitations, we propose an improved ABC algorithm called DABC, which introduces a dedicated deduplication mechanism to enhance diversity and convergence efficiency. This mechanism consists of two tightly integrated stages: (i) a novel duplicate bee identifier that marks redundant individuals based on objective-level similarity, and (ii) a differential analysis that evaluates dissimilarities between duplicate bees and the overall population, guiding their adaptive update through weighted bitwise recombination. This joint strategy significantly reduces redundant evaluations, promotes diversity, and enhances the algorithm’s capacity to escape local optima. DABC is evaluated against seven state-of-the-art evolutionary algorithms across 24 benchmark classification datasets. Experimental results demonstrate that DABC achieves superior classification accuracy, faster convergence, and more compact feature subsets. It achieves the lowest mean classification error on nine datasets and ranks second on 11 others. Wilcoxon rank-sum tests confirm its statistical superiority over six baselines. AUC analysis further highlights its discriminative power, achieving 0.994 on Breast, 0.971 on MUSK1, and AUC \(\ge\) 0.91 on multi-class datasets such as URBAN1 and Vehicle. The effectiveness of its diversity-guided deduplication process is further validated through ablation studies and population diversity analysis. Overall, DABC presents a robust and efficient solution for FS, particularly in complex, high-dimensional settings.


27 February 2025 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
ZXZhe Xu
Zhe Xu
JYJiatianyi Yu
Jiatianyi Yu
BZBaohang Zhang
Baohang Zhang
LYLin Yang
Lin Yang
YLYanting Liu
Yanting Liu
Shangce GaoShangce Gao
Shangce Gao

15 July 2023
Verified
Book Chapter
Closed access
PDF file
CZChen Zhang
Chen Zhang
HLHaotian Li
Haotian Li
YYYifei Yang
Yifei Yang
BZBaohang Zhang
Baohang Zhang
HZHuisheng Zhu
Huisheng Zhu
Shangce GaoShangce Gao
Shangce Gao