title: Evaluating machine learning approaches for aiding probe selection for gene-expression arrays.
abstract: BACKGROUND
  Microarrays are a fast and cost-effective method of performing thousands of DNA hybridization experiments simultaneously. DNA probes are typically used to measure the expression level of specific genes. Because probes greatly vary in the quality of their hybridizations, choosing good probes is a difficult task. If one could accurately choose probes that are likely to hybridize well, then fewer probes would be needed to represent each gene in a gene-expression microarray, and, hence, more genes could be placed on an array of a given physical size. Our goal is to empirically evaluate how successfully three standard machine-learning algorithms-naïve Bayes, decision trees, and artificial neural networks-can be applied to the task of predicting good probes. Fortunately it is relatively easy to get training examples for such a learning task: place various probes on a gene chip, add a sample where the corresponding genes are highly expressed, and then record how well each probe measures the presence of its corresponding gene. With such training examples, it is possible that an accurate predictor of probe quality can be learned.
  
  
  RESULTS
  Two of the learning algorithms we investigate-naïve Bayes and neural networks-learn to predict probe quality surprisingly well. For example, in the top ten predicted probes for a given gene not used for training, on average about five rank in the top 2.5% of that gene's hundreds of possible probes. Decision-tree induction and the simple approach of using predicted melting temperature to rank probes perform significantly worse than these two algorithms. The features we use to represent probes are very easily computed and the time taken to score each candidate probe after training is minor. Training the naïve Bayes algorithm takes very little time, and while it takes over 10 times as long to train a neural network, that time is still not very substantial (on the order of a few hours on a desktop workstation). We also report the information contained in the features we use to describe the probes. We find the fraction of cytosine in the probe to be the most informative feature. We also find, not surprisingly, that the nucleotides in the middle of the probes sequence are more informative than those at the ends of the sequence.
authors.affiliation: Department of Computer Science, University of Wisconsin, 1210 West Dayton Street, Madison, WI 53706, USA.
authors.forename: J B
authors.initials: JB
authors.lastname: Tobler
authors.forename: M N
authors.initials: MN
authors.lastname: Molla
authors.forename: E F
authors.initials: EF
authors.lastname: Nuwaysir
authors.forename: R D
authors.initials: RD
authors.lastname: Green
authors.forename: J W
authors.initials: JW
authors.lastname: Shavlik
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D001499:Bayes Theorem; D015342:DNA Probes; D020869:Gene Expression Profiling / Q000379:methods*; D008957:Models, Genetic; D015233:Models, Statistical; D016571:Neural Networks, Computer; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D017422:Sequence Analysis, DNA
chemical_list: D015342:DNA Probes