A novel recursive gene selection method based on least square kernel extreme learning machine.
2021
This paper presents a recursive feature elimination (RFE) mechanism to select the most informative genes with a least square kernel extreme learning machine (LSKELM) classifier. Describing the generalization ability of LSKELM in a way that is related to small norm of weights, we proposed a ranking criterion to evaluate the importance of genes by the norm of weights obtained by LSKELM network. The proposed method is called LSKELM-RFE algorithm, which first employs the original genes to build a LSKELM classifier, and then ranks the genes according to their importance given by the norm of LSKELM network output weights, and finally removes a least important gene. Benefiting from the random mapping mechanism of the extreme learning machine (ELM) kernel, there are no parameter of LSKELM-RFE needs to be manually tuned. A comparative study among our proposed algorithm and other two famous RFE algorithms has shown that LSKELM-RFE outperforms other RFE algorithms in both the computational cost and generalization ability.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI