A comprehensive comparison of random forests and support vector machines for microarray-based cancer classification
1 Department of Biomedical Informatics, Vanderbilt University, Nashville, TN, USA
2 Department of Biostatistics, Vanderbilt University, Nashville, TN, USA
3 Department of Cancer Biology, Vanderbilt University, Nashville, TN, USA
4 Department of Computer Science, Vanderbilt University, Nashville, TN, USA
BMC Bioinformatics 2008, 9:319 doi:10.1186/1471-2105-9-319Published: 22 July 2008
Cancer diagnosis and clinical outcome prediction are among the most important emerging applications of gene expression microarray technology with several molecular signatures on their way toward clinical deployment. Use of the most accurate classification algorithms available for microarray gene expression data is a critical ingredient in order to develop the best possible molecular signatures for patient care. As suggested by a large body of literature to date, support vector machines can be considered "best of class" algorithms for classification of such data. Recent work, however, suggests that random forest classifiers may outperform support vector machines in this domain.
In the present paper we identify methodological biases of prior work comparing random forests and support vector machines and conduct a new rigorous evaluation of the two algorithms that corrects these limitations. Our experiments use 22 diagnostic and prognostic datasets and show that support vector machines outperform random forests, often by a large margin. Our data also underlines the importance of sound research design in benchmarking and comparison of bioinformatics algorithms.
We found that both on average and in the majority of microarray datasets, random forests are outperformed by support vector machines both in the settings when no gene selection is performed and when several popular gene selection methods are used.