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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 25,410
(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
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
An Introduction to Kernel and Nearest-Neighbor Nonparametric Regression
Altman, N. S. (1992) · The American Statistician · doi:10.1080/00031305.1992.10475879 · Cited by 5,708
Proceedings of the 25th international conference on Machine learning
Cohen, W. W., McCallum, A., & Roweis, S. T. (2008) · Cited by 5,691
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
A discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
Feature selection for classification
DASH, M., & LIU, H. (1997) · Intelligent Data Analysis · doi:10.1016/s1088-467x(97)00008-5 · Cited by 3,574
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Grasshopper Optimisation Algorithm: Theory and application
Saremi, S., Mirjalili, S., & Lewis, A. (2017) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2017.01.004 · Cited by 2,727
Self-citationToward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
Metaheuristics : from desing to implementation
Talbi, E. (2009) · HAL · Cited by 2,494
Elements of Information Theory
Nalewajski, R. F. (2011) · Perspectives in Electronic Structure Theory · doi:10.1007/978-3-642-20180-6_8 · Cited by 2,309
Feature selection for high-dimensional data: a fast correlation-based filter solution
Yu, L., & Liu, H. (2003) · Cited by 2,305
The feature selection problem: traditional methods and a new algorithm
Kira, K., & Rendell, L. A. (1992) · National Conference on Artificial Intelligence · Cited by 1,897
Binary grey wolf optimization approaches for feature selection
Emary, E., Zawbaa, H. M., & Hassanien, A. E. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.06.083 · Cited by 1,410
Feature subset selection using a genetic algorithm
Yang, J., & Honavar, V. (1998) · IEEE Intelligent Systems · doi:10.1109/5254.671091 · Cited by 1,362
Hybrid Whale Optimization Algorithm with simulated annealing for feature selection
Mafarja, M. M., & Mirjalili, S. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.04.053 · Cited by 1,148
Self-citationS-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization
Mirjalili, S., & Lewis, A. (2013) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2012.09.002 · Cited by 1,099
Self-citationSpectral feature selection for supervised and unsupervised learning
Zhao, Z., & Liu, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273641 · Cited by 906
Feature selection based on rough sets and particle swarm optimization
Wang, X., Yang, J., Teng, X., Xia, W., & Jensen, R. (2007) · Pattern Recognition Letters · doi:10.1016/j.patrec.2006.09.003 · Cited by 837
Overcoming the Myopia of Inductive Learning Algorithms with RELIEFF
Kononenko, I., Šimec, E., & Robnik-Šikonja, M. (1997) · Applied Intelligence · doi:10.1023/a:1008280620621 · Cited by 796
BGSA: binary gravitational search algorithm
Rashedi, E., Nezamabadi-pour, H., & Saryazdi, S. (2010) · Natural Computing · doi:10.1007/s11047-009-9175-3 · Cited by 733
Feature Extraction Construction and Selection: A Data Mining Perspective
MTW, Liu, H., & Motoda, H. (1999) · Journal of the American Statistical Association · doi:10.2307/2669967 · Cited by 713
(2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4 · Cited by 677
Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches
Jensen, R., & Shen, Q. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.96 · Cited by 667
Xue, B., Zhang, M., & Browne, W. N. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2013.09.018 · Cited by 614
Feature Selection for Machine Learning: Comparing a Correlation-Based Filter Approach to the Wrapper
Hall, M. A., & Smith, L. A. (1999) · Cited by 557
Binary ant lion approaches for feature selection
Emary, E., Zawbaa, H. M., & Hassanien, A. E. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.03.101 · Cited by 483
Yin, X., Ng, B. W.-H., & Abbott, D. (2012) · Terahertz Imaging for Biomedical Applications · doi:10.1007/978-1-4614-1821-4_8 · Cited by 480
Recent advances in feature selection and its applications
Li, Y., Li, T., & Liu, H. (2017) · Knowledge and Information Systems · doi:10.1007/s10115-017-1059-8 · Cited by 400
Text feature selection using ant colony optimization
Aghdam, M. H., Ghasem-Aghaee, N., & Basiri, M. E. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.08.022 · Cited by 389
Moradi, P., & Gholampour, M. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.01.044 · Cited by 372
A hybrid approach of differential evolution and artificial bee colony for feature selection
Zorarpacı, E., & Özel, S. A. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.06.004 · Cited by 371
A hybrid feature selection algorithm for gene expression data classification
Lu, H., Chen, J., Yan, K., Jin, Q., Xue, Y., & Gao, Z. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.07.080 · Cited by 354
An advanced ACO algorithm for feature subset selection
Kashef, S., & Nezamabadi-pour, H. (2015) · Neurocomputing · doi:10.1016/j.neucom.2014.06.067 · Cited by 333
A behavioural analysis of phase change in the desert locust
SIMPSON, S. J., McCAFFERY, A. R., & HÄGELE, B. F. (1999) · Biological Reviews · doi:10.1111/j.1469-185x.1999.tb00038.x · Cited by 287
A new local search based hybrid genetic algorithm for feature selection
Kabir, M. M., Shahjahan, M., & Murase, K. (2011) · Neurocomputing · doi:10.1016/j.neucom.2011.03.034 · Cited by 264
A new hybrid ant colony optimization algorithm for feature selection
Kabir, M. M., Shahjahan, M., & Murase, K. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.09.073 · Cited by 252
A behavioural analysis of phase change in the desert locust
SIMPSON, S. J., McCAFFERY, A. R., & HÄGELE, B. F. (1999) · Biological Reviews of the Cambridge Philosophical Society · doi:10.1017/s000632319900540x · Cited by 211
Solving feature subset selection problem by a Parallel Scatter Search
Garcı́a López, F., Garcı́a Torres, M., Melián Batista, B., Moreno Pérez, J. A., & Moreno-Vega, J. M. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.08.010 · Cited by 186
A feature selection method based on modified binary coded ant colony optimization algorithm
Wan, Y., Wang, M., Ye, Z., & Lai, X. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.08.011 · Cited by 178
Differential evolution algorithm as a tool for optimal feature subset selection in motor imagery EEG
Baig, M. Z., Aslam, N., Shum, H. P. H., & Zhang, L. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.07.033 · Cited by 167
Feature Selection via Chaotic Antlion Optimization
Zawbaa, H. M., Emary, E., & Grosan, C. (2016) · PLOS ONE · doi:10.1371/journal.pone.0150652 · Cited by 166
Tabu search for attribute reduction in rough set theory
Hedar, A.-R., Wang, J., & Fukushima, M. (2007) · Soft Computing · doi:10.1007/s00500-007-0260-1 · Cited by 156
Katrutsa, A., & Strijov, V. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.01.048 · Cited by 155
Literature Review on Feature Selection Methods for High-Dimensional Data
Singh, D. A. A. G., Appavu, S., & Leavline, E. J. (2016) · International Journal of Computer Applications · doi:10.5120/ijca2016908317 · Cited by 143
Wieland, M., & Pittore, M. (2014) · Remote Sensing · doi:10.3390/rs6042912 · Cited by 141
Feature selection based on FDA and F-score for multi-class classification
Song, Q., Jiang, H., & Liu, J. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.02.049 · Cited by 127
Unsupervised probabilistic feature selection using ant colony optimization
Dadaneh, B. Z., Markid, H. Y., & Zakerolhosseini, A. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.01.021 · Cited by 104
Rough set and scatter search metaheuristic based feature selection for credit scoring
Wang, J., Hedar, A.-R., Wang, S., & Ma, J. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.11.011 · Cited by 85
Feature subset selection by particle swarm optimization with fuzzy fitness function
Chakraborty, B. (2008) · doi:10.1109/iske.2008.4731082 · Cited by 75
Zarshenas, A., & Suzuki, K. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.07.026 · Cited by 61
A Minimal Subset of Features Using Feature Selection for Handwritten Digit Recognition
Alsaafin, A., & Elnagar, A. (2017) · Journal of Intelligent Learning Systems and Applications · doi:10.4236/jilsa.2017.94006 · Cited by 34
Current Topics in Artificial Intelligence
(2004) · Lecture notes in computer science · doi:10.1007/b98369 · Cited by 13
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
A comprehensive survey on recent metaheuristics for feature selection
Dokeroglu, T., Deniz, A., & Kiziloz, H. E. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.04.083 · Cited by 356
A new fusion of grey wolf optimizer algorithm with a two-phase mutation for feature selection
Abdel-Basset, M., El-Shahat, D., El-henawy, I., de Albuquerque, V. H. C., & Mirjalili, S. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112824 · Cited by 333
Self-citationGrasshopper 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-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
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.