.png){kind=icon}
.png){kind=icon}
Return
Expectation Propagation for microarray data classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2010.05.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Microarray experiments are a very promising tool for early diagnosis and disease treatment. The datasets obtained in these experiments typically consist of a small number of instances and a large number of covariates, most of which are irrelevant for discrimination. These characteristics pose severe difficulties for standard learning algorithms. A Bayesian approach can be useful to overcome these problems and produce more accurate and robust predictions. However, exact Bayesian inference is computationally costly and in many cases infeasible. In practice, some form of approximation has to be made. In this paper we consider a Bayesian linear model for microarray data classification based on a prior distribution that favors sparsity in the model coefficients. Expectation Propagation (EP) is then used to perform approximate inference as an alternative to computationally more expensive methods, such as Markov Chain Monte Carlo (MCMC) sampling. The model considered is evaluated on 15 microarray datasets and compared with other state-of-the-art classification algorithms. These experiments show that the Bayesian model trained with EP performs well on the datasets investigated and is also useful to identify relevant genes for subsequent analysis. (C) 2010 Elsevier B.V. All rights reserved.
Keywords:
Microarray data
Bayesian inference
Expectation Propagation
Journal
IF:
3.3
Papers:
7.8K
Citations:
1.6W