Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 289

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Orthogonal learning covariance matrix for defects of grey wolf optimizer: Insights, balance, diversity, and feature selection

Hu, Jiao, Chen, Huiling, Heidari, Ali Asghar, Wang, Mingjing, Zhang, Xiaoqin, Chen, Ying, Pan, Zhifang·2021·Knowledge-Based Systems

Abstract

Abstract This research’s genesis is in two aspects: first, a guaranteed solution for mitigating the grey wolf optimizer’s (GWO) defects and deficiencies. Second, we provide new open-minding insights and deep views about metaheuristic algorithms. The population-based GWO has been recognized as a popular option for realizing optimal solutions. Despite the popularity, the GWO has structural defects and uncertain performance and has certain limitations when dealing with complex problems such as multimodality and hybrid functions. This paper tries to overhaul the shortcomings of the original process and develops a GWO variant enhanced with a covariance matrix adaptation evolution strategy (CMAES), levy flight mechanism, and orthogonal learning (OL) strategy named GWOCMALOL. The algorithm uses the levy flight mechanism, orthogonal learning strategy, and CMAES to bring more effective exploratory inclinations. We conduct numerical experiments based on various functions in IEEE CEC2014. It is also compared with 10 other algorithms with competitive performances, 7 improved GWO variants, and 11 advanced algorithms. Moreover, for more systematic data analysis, Wilcoxon signed-rank test is used to evaluate the results further. Experimental results show that the GWOCMALOL algorithm is superior to other algorithms in terms of convergence speed and accuracy. The proposed GWO-based version is discretized into a binary tool through the transformation function. We evaluate the performance of the new feature selection method based on 24 UCI datasets. Experimental results show that the developed algorithm performs better than the original technique, and the defects are resolved. Besides, we could reach higher classification accuracy and fewer feature selections than other optimization algorithms.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.knosys.2020.106684

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 289

Metadata

Authors
Hu, J., Chen, H., Heidari, A. A., Wang, M., Zhang, X., Chen, Y., & Pan, Z.
Venue
Knowledge-Based Systems
Publisher
Elsevier BV
Published
2021-02
Volume
213
Pages
106684
ISSN
0950-7051 (ISSN-L)
OpenAlex
W3112535140
Cited by
289
References
3
FWCI
21.88
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Orthogonal learning covariance matrix for defects of grey wolf optimizer: Insights, balance, diversity, and feature selection. https://app.cochat.ai/papers/10.1016/j.knosys.2020.106684
The paper
Hu, J., Chen, H., Heidari, A. A., Wang, M., Zhang, X., Chen, Y., & Pan, Z. (2021). Orthogonal learning covariance matrix for defects of grey wolf optimizer: Insights, balance, diversity, and feature selection. Knowledge-Based Systems. https://doi.org/10.1016/j.knosys.2020.106684

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.