title: Iterative feature removal yields highly discriminative pathways.
abstract: BACKGROUND
  We introduce Iterative Feature Removal (IFR) as an unbiased approach for selecting features with diagnostic capacity from large data sets. The algorithm is based on recently developed tools in machine learning that are driven by sparse feature selection goals. When applied to genomic data, our method is designed to identify genes that can provide deeper insight into complex interactions while remaining directly connected to diagnostic utility. We contrast this approach with the search for a minimal best set of discriminative genes, which can provide only an incomplete picture of the biological complexity.
  
  
  RESULTS
  Microarray data sets typically contain far more features (genes) than samples. For this type of data, we demonstrate that there are many equivalently-predictive subsets of genes. We iteratively train a classifier using features identified via a sparse support vector machine. At each iteration, we remove all the features that were previously selected. We found that we could iterate many times before a sustained drop in accuracy occurs, with each iteration removing approximately 30 genes from consideration. The classification accuracy on test data remains essentially flat even as hundreds of top-genes are removed.Our method identifies sets of genes that are highly predictive, even when comprised of genes that individually are not. Through automated and manual analysis of the selected genes, we demonstrate that the selected features expose relevant pathways that other approaches would have missed.
  
  
  CONCLUSIONS
  Our results challenge the paradigm of using feature selection techniques to design parsimonious classifiers from microarray and similar high-dimensional, small-sample-size data sets. The fact that there are many subsets of genes that work equally well to classify the data provides a strong counter-result to the notion that there is a small number of "top genes" that should be used to build classifiers. In our results, the best classifiers were formed using genes with limited univariate power, thus illustrating that deeper mining of features using multivariate techniques is important.
authors.forename: Stephen
authors.initials: S
authors.lastname: O'Hara
authors.forename: Kun
authors.initials: K
authors.lastname: Wang
authors.forename: Richard A
authors.initials: RA
authors.lastname: Slayden
authors.forename: Alan R
authors.initials: AR
authors.lastname: Schenkel
authors.forename: Greg
authors.initials: G
authors.lastname: Huber
authors.forename: Corey S
authors.initials: CS
authors.lastname: O'Hern
authors.forename: Mark D
authors.initials: MD
authors.lastname: Shattuck
authors.affiliation: Department of Mathematics, Colorado State University, Fort Collins, CO, USA. kirby@math.colostate.edu.
authors.forename: Michael
authors.initials: M
authors.lastname: Kirby
mesh_terms: D019295:Computational Biology / Q000379:methods*; D053263:Gene Regulatory Networks; D006801:Humans; D007251:Influenza, Human / Q000235:genetics; D008962:Models, Theoretical; D009369:Neoplasms / Q000235:genetics; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D060388:Support Vector Machine