Abstract
In recent years, feature selection has emerged as a major challenge in machine learning. In this paper, considering the promising performance of metaheuristics on different types of applications, six physics-inspired metaphor algorithms are employed for this problem. To evaluate the capability of dimensionality reduction in these algorithms, six diverse-natured datasets are used. The performance is compared in terms of the average number of features selected (AFS), accuracy, fitness, convergence capabilities, and computational cost. It is found through experiments that the accuracy and fitness of the Equilibrium Optimizer (EO) are comparatively better than the others. Finally, the average rank from the perspective of average fitness, average accuracy, and AFS shows that EO outperforms all other algorithms.
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference38 articles.
1. Köppen, M. (2000, January 4–18). The curse of dimensionality. Proceedings of the 5th Online World Conference on Soft Computing in Industrial Applications (WSC5), Online.
2. Ikotun, A.M., Almutari, M.S., and Ezugwu, A.E. (2021). K-Means-Based Nature-Inspired Metaheuristic Algorithms for Automatic Data Clustering Problems: Recent Advances and Future Directions. Appl. Sci., 11.
3. Khalid, S., Khalil, T., and Nasreen, S. (2014, January 27–29). A survey of feature selection and feature extraction techniques in machine learning. Proceedings of the Science and Information Conference (SAI), London, UK.
4. Comparison of filter based feature selection algorithms: An overview;Porkodi;Int. J. Innov. Res. Technol. Sci.,2014
5. Jović, A., Brkić, K., and Bogunović, N. (2015, January 25–29). A review of feature selection methods with applications. Proceedings of the 2015 38th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), Opatija, Croatia.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献