Feature selection algorithm based on P systems
Since the number of features of the dataset is much higher than the number of patterns, the higher the dimension of the data, the greater the impact on the learning algorithm. Dimension disaster has become an important problem. Feature selection can effectively reduce the dimension of the dataset an...
Saved in:
| Published in | Natural computing Vol. 22; no. 1; pp. 149 - 159 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Dordrecht
Springer Netherlands
01.03.2023
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1567-7818 1572-9796 1572-9796 |
| DOI | 10.1007/s11047-022-09912-3 |
Cover
| Summary: | Since the number of features of the dataset is much higher than the number of patterns, the higher the dimension of the data, the greater the impact on the learning algorithm. Dimension disaster has become an important problem. Feature selection can effectively reduce the dimension of the dataset and improve the performance of the algorithm. Thus, in this paper, A feature selection algorithm based on P systems (P-FS) is proposed to exploit the parallel ability of cell-like P systems and the advantage of evolutionary algorithms in search space to select features and remove redundant information in the data. The proposed P-FS algorithm is tested on five UCI datasets and an edible oil dataset from practical applications. At the same time, the P-FS algorithm and genetic algorithm feature selection (GAFS) are compared and tested on six datasets. The experimental results show that the P-FS algorithm has good performance in classification accuracy, stability, and convergence. Thus, the P-FS algorithm is feasible in feature selection. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1567-7818 1572-9796 1572-9796 |
| DOI: | 10.1007/s11047-022-09912-3 |