Multi-objective optimization algorithm based on clustering guided binary equilibrium optimizer and NSGA-III to solve high-dimensional feature selection problem

Feature selection (FS) is an indispensable activity in machine learning, whose purpose is to identify relevant predictive values from a high-dimensional feature space to improve performance and reduce model learning time. However, the large increase in feature dimensions poses a great challenge to FS methods. Therefore, a multi-objective optimization algorithm consisting of an Equilibrium Optimizer (EO) and NSGA-III was proposed to solve the FS problem with high-dimensional data. Through S-shaped, V-shaped and U-shaped transfer functions, the conversion from real number coding to binary coding is realized to solve discrete problems, and the influence of these three transfer functions on the effect of FS is compared. In addition, the algorithm op-timizes the population in the binary search space by building an external archive, and realizes the selection and optimization of external archive individuals based on the clustering strategy. The KNN classifier was used to realize the classification progress. The simulation experiments are divided into two groups with 18 medium and high dimensional data. The first group analyzes the optimization effect of the proposed framework under three transfer functions. The second group of experiments selects the algorithm that wins in the first group of experiments and compares it with eleven classical multi-objective optimization algorithms. The evaluation criteria includes two optimization objectives of the FS problem and the optimization indices of HV and IGD. The first set of experiments showed that the U-shaped transfer function family performed best in the FS problem, with U3 being the most excellent, followed by V-shaped and S-shaped. Compared to other multi-objective optimization algorithms, the simulation results also confirm the effective-ness of the proposed strategy.