improving the k-nearest neighbor classifier using the cheetah optimization algorithm to increase classification performance

Feature selection has emerged as a combinatorial optimization problem where the focus is on selecting a subset of input features that efficiently represent the input data, reducing the effects of noisy and irrelevant variables, and providing acceptable predictive outcomes. various methods, including filter, wrapper, and embedded approaches, exist for feature selection. nowadays, meta-heuristic search algorithms, particularly those under the wrapper method, are widely used in feature selection problems. in recent years, inspired by nature, various evolutionary algorithms have been proposed for the feature selection problem, indicating its high significance. all of these algorithms are attempting to increase classification accuracy by reducing the number of features. therefore, in this research, the cheetah optimization algorithm (choa) is employed to enhance the speed and accuracy of k-nearest neighbor classifier. reference datasets are used to evaluate the results of the proposed method. the evaluation results demonstrate that the proposed approach outperforms other methods in terms of classification accuracy.