This article is part of the supplement: IEEE 7th International COnference on Bioinformatics and Bioengineering at Harvard Medical School
Gene selection algorithm by combining reliefF and mRMR
1 School of Computer Science, Florida International University, 11200 SW 8th Street, Miami, FL, 33199, USA
2 Department of Computer Science and Engineering, University of Texas at Arlington, 416 Yates Street, Arlington, TX, 76019, USA
BMC Genomics 2008, 9(Suppl 2):S27 doi:10.1186/1471-2164-9-S2-S27Published: 16 September 2008
Gene expression data usually contains a large number of genes, but a small number of samples. Feature selection for gene expression data aims at finding a set of genes that best discriminate biological samples of different types. In this paper, we present a two-stage selection algorithm by combining ReliefF and mRMR: In the first stage, ReliefF is applied to find a candidate gene set; In the second stage, mRMR method is applied to directly and explicitly reduce redundancy for selecting a compact yet effective gene subset from the candidate set.
We perform comprehensive experiments to compare the mRMR-ReliefF selection algorithm with ReliefF, mRMR and other feature selection methods using two classifiers as SVM and Naive Bayes, on seven different datasets. And we also provide all source codes and datasets for sharing with others.
The experimental results show that the mRMR-ReliefF gene selection algorithm is very effective.