Abstract

Arithmetic optimization algorithm (AOA) is a meta-heuristic algorithm inspired by mathematical operations. AOA has been diffusely used for optimization issues on continuous domains, but few scholars have studied discrete optimization problems. In this paper, we proposed Binary AOA (BAOA) based on two strategies to handle the feature selection problem. The first strategy used S-shaped and V-shaped shift functions to map continuous variables to discrete variables. The second strategy was to combine four logical operations (AND, OR, XOR, XNOR) on the basis of the transfer function, and constructed a parameter model based on the sine and cosine function. An enhanced logic binary sine–cosine function arithmetic optimization algorithm (LBSCAOA) was proposed to realize the position update of variables. Its purpose was to improve the algorithm's global search capabilities and local exploitation capabilities. In the simulation experiments, 20 datasets were selected to testify the capability of the proposed algorithm. Since KNN had the advantages of easy understanding and low training time complexity, this classifier was selected for evaluation. The performance of the improved algorithm was comprehensively evaluated by comparing the average classification accuracy, the average number of selected features, the average fitness value and the average running time. Simulation results showed LBSCAOA with V-Shaped “V4” stood out among many improved algorithms. On the other hand, LBSCAOA with V-Shaped “V4” was used as a representative to compare with other typical feature selection algorithms to verify its competitivenes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call