Feature selection using firefly optimization for classification and regression models
作者:
Highlights:
• We propose a variant of the Firefly Algorithm for feature optimization.
• SA-enhanced local and global optimal solutions are used to lead the search process.
• The attractiveness search action is also further diversified using chaotic maps.
• Swarm leaders divert weak solutions to optimal regions to accelerate convergence.
• It outperforms other methods statistically for the evaluation of 40 data sets.
摘要
In this research, we propose a variant of the Firefly Algorithm (FA) for discriminative feature selection in classification and regression models for supporting decision making processes using data-based learning methods. The FA variant employs Simulated Annealing (SA)-enhanced local and global promising solutions, chaotic-accelerated attractiveness parameters and diversion mechanisms of weak solutions to escape from the local optimum trap and mitigate the premature convergence problem in the original FA algorithm. A total of 29 classification and 11 regression benchmark data sets have been used to evaluate the efficiency of the proposed FA model. It shows statistically significant improvements over other state-of-the-art FA variants and classical search methods for diverse feature selection problems. In short, the proposed FA variant offers an effective method to identify optimal feature subsets in classification and regression models for supporting data-based decision making processes.
论文关键词:Feature selection,Dimensionality reduction,Classification,Regression,Firefly algorithm
论文评审过程:Received 16 April 2017, Revised 19 November 2017, Accepted 3 December 2017, Available online 7 December 2017, Version of Record 12 January 2018.
论文官网地址:https://doi.org/10.1016/j.dss.2017.12.001