Boosted Spider Wasp Optimizer for High-dimensional Feature Selection

With the increasing dimensionality of the data, High-dimensional Feature Selection (HFS) becomes an increasingly difficult task. It is not simple to find the best subset of features due to the breadth of the search space and the intricacy of the interactions between features. Many of the Feature Selection (FS) approaches now in use for these problems perform significantly less well when faced with such intricate situations involving high-dimensional search spaces. It is demonstrated that meta-heuristic algorithms can provide sub-optimal results in an acceptable amount of time. This paper presents a new binary Boosted version of the Spider Wasp Optimizer (BSWO) called Binary Boosted SWO (BBSWO), which combines a number of successful and promising strategies, in order to deal with HFS. The shortcomings of the original BSWO, including early convergence, settling into local optimums, limited exploration and exploitation, and lack of population diversity, were addressed by the proposal of this new variant of SWO. The concept of chaos optimization is introduced in BSWO, where initialization is consistently produced by utilizing the properties of sine chaos mapping. A new convergence parameter was then incorporated into BSWO to achieve a promising balance between exploration and exploitation. Multiple exploration mechanisms were then applied in conjunction with several exploitation strategies to effectively enrich the search process of BSWO within the search space. Finally, quantum-based optimization was added to enhance the diversity of the search agents in BSWO. The proposed BBSWO not only offers the most suitable subset of features located, but it also lessens the data’s redundancy structure. BBSWO was evaluated using the k-Nearest Neighbor (k-NN) classifier on 23 HFS problems from the biomedical domain taken from the UCI repository. The results were compared with those of traditional BSWO and other well-known meta-heuristics-based FS. The findings indicate that, in comparison to other competing techniques, the proposed BBSWO can, on average, identify the least significant subsets of features with efficient classification accuracy of the k-NN classifier.