Zhiqing Guo

Zhiqing Guo

Auto-generated profile, based on publicly available information

Zhiqing Guo

College of Mining, Liaoning Technical University, Fuxin, Liaoning, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
19 May 2022 in PLOS ONE
Verified
Journal Article
Open access
PDF file
WLWei Liu
Wei Liu
ZGZhiqing Guo
Zhiqing Guo
FJFeng Jiang
Feng Jiang
GLGuangwei Liu
Guangwei Liu
DWDong Wang
Dong Wang
ZNZishun Ni
Zishun Ni
Feature selection (FS) can eliminate many redundant, irrelevant, and noisy features in high-dimensional data to improve machine learning or data mining models’ prediction, classification, and computational performance. We proposed an improved whale optimization algorithm (IWOA) and improved k-nearest neighbors (IKNN) classifier approaches for feature selection (IWOAIKFS). Firstly, WOA is improved by using chaotic elite reverse individual, probability selection of skew distribution, nonlinear adjustment of control parameters and position correction strategy to enhance the search performance of the algorithm for feature subsets. Secondly, the sample similarity measurement criterion and weighted voting criterion based on the simulated annealing algorithm to solve the weight matrix M are proposed to improve the KNN classifier and improve the evaluation performance of the algorithm on feature subsets. The experimental results show: IWOA not only has better optimization performance when solving benchmark functions of different dimensions, but also when used with IKNN for feature selection, IWOAIKFS has better classification and robustness.

2 January 2024 in PLOS ONE
Verified
Journal Article
Open access
PDF file
GLGuangwei Liu
Guangwei Liu
ZGZhiqing Guo
Zhiqing Guo
WLwei liu
wei liu
Feng JiangFeng Jiang
Feng Jiang
EFEnsan Fu
Ensan Fu
This paper proposes a feature selection method based on a hybrid optimization algorithm that combines the Golden Jackal Optimization (GJO) and Grey Wolf Optimizer (GWO). The primary objective of this method is to create an effective data dimensionality reduction technique for eliminating redundant, irrelevant, and noisy features within high-dimensional datasets. Drawing inspiration from the Chinese idiom “Chai Lang Hu Bao,” hybrid algorithm mechanisms, and cooperative behaviors observed in natural animal populations, we amalgamate the GWO algorithm, the Lagrange interpolation method, and the GJO algorithm to propose the multi-strategy fusion GJO-GWO algorithm. In Case 1, the GJO-GWO algorithm addressed eight complex benchmark functions. In Case 2, GJO-GWO was utilized to tackle ten feature selection problems. Experimental results consistently demonstrate that under identical experimental conditions, whether solving complex benchmark functions or addressing feature selection problems, GJO-GWO exhibits smaller means, lower standard deviations, higher classification accuracy, and reduced execution times. These findings affirm the superior optimization performance, classification accuracy, and stability of the GJO-GWO algorithm.

11 August 2023 in PLOS ONE
Verified
Journal Article
Open access
PDF file
GLGuangwei Liu
Guangwei Liu
ZGZhiqing Guo
Zhiqing Guo
WLWei Liu
Wei Liu
BCBo Cao
Bo Cao
SCSenlin Chai
Senlin Chai
CWChunguang Wang
Chunguang Wang
This paper proposes a novel hybrid algorithm, named Multi-Strategy Hybrid Harris Hawks Tunicate Swarm Optimization Algorithm (MSHHOTSA). The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. Firstly, inspired by the idea of the neighborhood and thermal distribution map, the hyperbolic tangent domain is introduced to modify the position of new tunicate individuals, which can not only effectively enhance the convergence performance of the algorithm but also ensure that the data generated between the unknown parameters and the old parameters have a similar distribution. Secondly, the nonlinear convergence factor is constructed to replace the original random factor c1 to coordinate the algorithm’s local exploitation and global exploration performance, which effectively improves the ability of the algorithm to escape extreme values and fast convergence. Finally, the swarm update mechanism of the HHO algorithm is introduced into the position update of the TSA algorithm, which further balances the local exploitation and global exploration performance of the MSHHOTSA. The proposed algorithm was evaluated on eight standard benchmark functions, CEC2019 benchmark functions, four engineering design problems, and a PID parameter optimization problem. It was compared with seven recently proposed metaheuristic algorithms, including HHO and TSA. The results were analyzed and discussed using statistical indicators such as mean, standard deviation, Wilcoxon’s rank sum test, and average running time. Experimental results demonstrate that the improved algorithm (MSHHOTSA) exhibits higher local convergence, global exploration, robustness, and universality than BOA, GWO, MVO, HHO, TSA, ASO, and WOA algorithms under the same experimental conditions.

28 January 2026 in Results in Engineering
Verified
Journal Article
Open access
ZGZhiqing Guo
Zhiqing Guo
GLGuangwei Liu
Guangwei Liu
SCSenlin Chai
Senlin Chai
WLwei liu
wei liu
FJFeng Jiang
Feng Jiang