.png){kind=icon}
.png){kind=icon}
Return
Feature selection optimized by the artificial immune algorithm based on genome shuffling and conditional lethal mutation
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-022-03971-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Improving classification performance is an essential goal for various practical applications. Feature selection has become an important data preprocessing step in machine learning systems. However, many effective methods based on heuristic search strategies have the problem of high running costs. This paper proposes an efficient multiobjective feature selection method based on artificial immune algorithm optimization. It introduces a clone selection algorithm to explore the search space of optimal feature subsets. According to the target requirements of feature selection, combined with biological research results, this method introduces genome shuffling technology and a conditional lethal mutation mechanism to improve the search performance of the algorithm. Experimental comparisons are conducted on 21 benchmark datasets with 17 advanced feature selection methods in terms of classification accuracy, the number of feature subsets, and computational cost. The results show that the algorithm achieves the smallest number of selected features (only 3.26% compared to the lowest) and better average classification accuracy with a much lower average computational cost than others (only 3.62% compared to the lowest).
Keywords:
Feature selection
Dimensionality reduction
Multiobjective optimization
Artificial immune algorithm
Classification