We analyse E-RFE (Entropy-based Recursive Feature Elimination), a new wrapper algorithm for fast feature ranking in classification problems. The E-RFE method operates the elimination of chunks of uninteresting features according to the entropy of the weights distribution of a SVM classifier. The method is designed to support computationally intensive model selection in classification problems in which the number of features is much largerthan the number of samples. We proofread the elimination procedure on synthetic data sets, and we demonstrate the applicability of E-RFE for the identification of biomedically important genes in predictive classification of microarray data
Gene selection and classification by entropy-based recursive feature elimination
Furlanello, Cesare;Serafini, Maria;Merler, Stefano;Jurman, Giuseppe
2003-01-01
Abstract
We analyse E-RFE (Entropy-based Recursive Feature Elimination), a new wrapper algorithm for fast feature ranking in classification problems. The E-RFE method operates the elimination of chunks of uninteresting features according to the entropy of the weights distribution of a SVM classifier. The method is designed to support computationally intensive model selection in classification problems in which the number of features is much largerthan the number of samples. We proofread the elimination procedure on synthetic data sets, and we demonstrate the applicability of E-RFE for the identification of biomedically important genes in predictive classification of microarray dataI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
