Parallel Binary Rafflesia Optimization Algorithm and Its Application in Feature Selection Problem

Abstract

The Rafflesia Optimization Algorithm (ROA) is a new swarm intelligence optimization algorithm inspired by Rafflesia’s biological laws. It has the advantages of high efficiency and fast convergence speed, and it effectively avoids falling into local optimum. It has been used in logistics distribution center location problems, and its superiority has been demonstrated. It is applied to solve the problem of continuity, but there are many binary problems to be solved in the actual situation. Thus, we designed a binary version of ROA. We used transfer functions to change continuous values into binary values, and binary values are used to symmetrically represent the meaning of physical problems. In this paper, four transfer functions are implemented to binarize ROA so as to improve the original transfer function for the overall performance of the algorithm. In addition, on the basis of the algorithm, we further improve the algorithm by adopting a parallel strategy, which improves the convergence speed and global exploration ability of the algorithm. The algorithm is verified on 23 benchmark functions, and the parallel binary ROA has a better performance than some other existing algorithms. In the aspect of the application, this paper adopts the datasets on UCI for feature selection. The improved algorithm has higher accuracy and selects fewer features.

Keywords

• parallel strategy
• Rafflesia Optimization Algorithm
• transfer function
• feature selection