Copula entropy-based golden jackal optimization algorithm for high-dimensional feature selection problems

Feature selection (FS) is a crucial process that aims to remove unnecessary features from datasets. It plays a role in data mining and machine learning (ML) by reducing the risk associated with high-dimensional datasets. FS is considered a challenging problem that is difficult to solve efficiently due to its combinatorial nature. As the size of the problem increases, the computation time also grows. Recently, researchers have focused on metaheuristic FS algorithms specifically designed for high-dimensional datasets. Therefore, this article proposes a powerful metaheuristic algorithm called Binary Enhanced Golden Jackal Optimization (BEGJO), which is an improved version of the recently published Golden Jackal Optimization (GJO) algorithm. The original GJO algorithm faces challenges when dealing with high-dimensional FS problems, as it tends to get trapped in local optima. To address this issue, various enhancement strategies are employed to improve the efficiency of GJO. The proposed BEGJO algorithm utilizes Copula Entropy (CE) to reduce the dimensionality of high-dimensional FS problems while maintaining high classification accuracy using the K-Nearest Neighbour (K-NN) classifier. Additionally, four enhancement strategies are incorporated to enhance the exploration and exploitation capabilities of the fundamental GJO algorithm. The BEGJO algorithm is transformed into its binary form using the sigmoid transfer function, aligning it with the nature of the FS problem. It is then tested on various high-dimensional benchmark datasets. The effectiveness of BEGJO is evaluated by comparing it with well-known algorithms in terms of classification accuracy, feature dimension, and processing time. BEGJO outperforms other algorithms in terms of classification accuracy and feature dimension and ranks up to fourth in terms of processing time. Furthermore, the advantageous use of CE is demonstrated by comparing the performance of the proposed algorithm with traditional FS algorithms. Statistical evaluations are conducted to further validate the effectiveness and superiority of the proposed algorithm. The results confirm that BEGJO is an effective solution for high-dimensional FS problems.