The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Binary grasshopper optimisation algorithm approaches for feature selection problems
Open accessAbstract
Abstract Feature Selection (FS) is a challenging machine learning-related task that aims at reducing the number of features by removing irrelevant, redundant and noisy data while maintaining an acceptable level of classification accuracy. FS can be considered as an optimisation problem. Due to the difficulty of this problem and having a large number of local solutions, stochastic optimisation algorithms are promising techniques to solve this problem. As a seminal attempt, binary variants of the recent Grasshopper Optimisation Algorithm (GOA) are proposed in this work and employed to select the optimal feature subset for classification purposes within a wrapper-based framework. Two mechanisms are employed to design a binary GOA, the first one is based on Sigmoid and V-shaped transfer functions, and will be indicated by BGOA-S and BGOA-V, respectively. While the second mechanism uses a novel technique that combines the best solution obtained so far. In addition, a mutation operator is employed to enhance the exploration phase in BGOA algorithm (BGOA-M). The proposed methods are evaluated using 25 standard UCI datasets and compared with 8 well-regarded metaheuristic wrapper-based approaches, and six well known filter-based (e.g., correlation FS) approaches. The comparative results show the superior performance of the BGOA and BGOA-M methods compared to other similar techniques in the literature.
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.
Integrity signals
Registry
Cites
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.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 24,155
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
Proceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,680
Cited by
An improved grey wolf optimizer for solving engineering problems
Nadimi-Shahraki, M. H., Taghian, S., & Mirjalili, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113917 · Cited by 1,153
Self-citationMetaheuristic Algorithms on Feature Selection: A Survey of One Decade of Research (2009-2019)
Agrawal, P., Abutarboush, H. F., Ganesh, T., & Mohamed, A. W. (2021) · IEEE Access · doi:10.1109/access.2021.3056407 · Cited by 613
Grasshopper Optimization Algorithm: Theory, Variants, and Applications
Meraihi, Y., Gabis, A. B., Mirjalili, S., & Ramdane-Cherif, A. (2021) · IEEE Access · doi:10.1109/access.2021.3067597 · Cited by 320
Self-citationA Comprehensive Analysis of Nature-Inspired Meta-Heuristic Techniques for Feature Selection Problem
Sharma, M., & Kaur, P. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-020-09412-6 · Cited by 303
Binary biogeography-based optimization based SVM-RFE for feature selection
Albashish, D., Hammouri, A. I., Braik, M., Atwan, J., & Sahran, S. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2020.107026 · Cited by 154
Self-citation
Metadata
- Authors
- Mafarja, M., Aljarah, I., Faris, H., Hammouri, A. I., Al-Zoubi, A. M., & Mirjalili, S.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2019-03
- Volume
- 117
- Pages
- 267-286
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2892079407
- Cited by
- 397
- References
- 63
- FWCI
- 28.71
- Type
- journal article
- Language
- en
- Open access
- green
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: Binary grasshopper optimisation algorithm approaches for feature selection problems. https://app.cochat.ai/papers/10.1016/j.eswa.2018.09.015
- The paper
- Mafarja, M., Aljarah, I., Faris, H., Hammouri, A. I., Al-Zoubi, A. M., & Mirjalili, S. (2019). Binary grasshopper optimisation algorithm approaches for feature selection problems. Expert Systems with Applications. https://doi.org/10.1016/j.eswa.2018.09.015
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.