title: Optimal number of features as a function of sample size for various classification rules.
abstract: BACKGROUND
  Given the joint feature-label distribution, increasing the number of features always results in decreased classification error; however, this is not the case when a classifier is designed via a classification rule from sample data. Typically (but not always), for fixed sample size, the error of a designed classifier decreases and then increases as the number of features grows. The potential downside of using too many features is most critical for small samples, which are commonplace for gene-expression-based classifiers for phenotype discrimination. For fixed sample size and feature-label distribution, the issue is to find an optimal number of features.
  
  
  RESULTS
  Since only in rare cases is there a known distribution of the error as a function of the number of features and sample size, this study employs simulation for various feature-label distributions and classification rules, and across a wide range of sample and feature-set sizes. To achieve the desired end, finding the optimal number of features as a function of sample size, it employs massively parallel computation. Seven classifiers are treated: 3-nearest-neighbor, Gaussian kernel, linear support vector machine, polynomial support vector machine, perceptron, regular histogram and linear discriminant analysis. Three Gaussian-based models are considered: linear, nonlinear and bimodal. In addition, real patient data from a large breast-cancer study is considered. To mitigate the combinatorial search for finding optimal feature sets, and to model the situation in which subsets of genes are co-regulated and correlation is internal to these subsets, we assume that the covariance matrix of the features is blocked, with each block corresponding to a group of correlated features. Altogether there are a large number of error surfaces for the many cases. These are provided in full on a companion website, which is meant to serve as resource for those working with small-sample classification.
  
  
  BACKGROUND
  For the companion website, please visit http://public.tgen.org/tamu/ofs/
  
  
  BACKGROUND
  e-dougherty@ee.tamu.edu.
authors.affiliation: Department of Electrical Engineering, Texas A&M University, College Station, TX 77843, USA.
authors.forename: Jianping
authors.initials: J
authors.lastname: Hua
authors.forename: Zixiang
authors.initials: Z
authors.lastname: Xiong
authors.forename: James
authors.initials: J
authors.lastname: Lowey
authors.forename: Edward
authors.initials: E
authors.lastname: Suh
authors.forename: Edward R
authors.initials: ER
authors.lastname: Dougherty
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D004247:DNA / Q000235:genetics*; D020869:Gene Expression Profiling / Q000379:methods*; D008957:Models, Genetic; D015233:Models, Statistical; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D010363:Pattern Recognition, Automated / Q000379:methods*; D018401:Sample Size; D017422:Sequence Analysis, DNA / Q000379:methods*
chemical_list: D004247:DNA