MARATTO

article · Mathematics

An Improved Binary Crayfish Optimization Algorithm for Handling Feature Selection Task in Supervised Classification

20247 citationsOpen accessKafr el-Sheikh University

Abstract

Feature selection (FS) is a crucial phase in data mining (DM) and machine learning (ML) tasks, aimed at removing uncorrelated and redundant attributes to enhance classification accuracy. This study introduces an improved binary crayfish optimization algorithm (IBCOA) designed to tackle the FS problem. The IBCOA integrates a local search strategy and a periodic mode boundary handling technique, significantly improving its ability to search and exploit the feature space. By doing so, the IBCOA effectively reduces dimensionality, while improving classification accuracy. The algorithm’s performance was evaluated using support vector machine (SVM) and k-nearest neighbor (k-NN) classifiers on eighteen multi-scale benchmark datasets. The findings showed that the IBCOA performed better than nine recent binary optimizers, attaining 100% accuracy and decreasing the feature set size by as much as 0.8. Statistical evidence supports that the proposed IBCOA is highly competitive according to the Wilcoxon rank sum test (alpha = 0.05). This study underscores the IBCOA’s potential for enhancing FS processes, providing a robust solution for high-dimensional data challenges.

Research topics

  • Metaheuristic Optimization Algorithms Research
  • Machine Learning and Data Classification
  • Evolutionary Algorithms and Applications

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

DOI: 10.3390/math12152364

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.