Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Bayesian computational modeling”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 631 records · Page 35Linked to original sources

Globally multimodal problem optimization via an estimation of distribution algorithm based on unsupervised learning of Bayesian networks.

Many optimization problems are what can be called globally multimodal, i.e., they present several global optima. Unfortunately, this is a major source of difficulties for most estimation of distribution algorithms, making their effectiveness and efficiency degrade, due to genetic drift. With the aim of overcoming these drawbacks for discrete globally multimodal problem optimization, this paper introduces and evaluates a new estimation of distribution algorithm based on unsupervised learning of Bayesian networks. We report the satisfactory results of our experiments with symmetrical binary optimization problems.

Algorithms↗

Trading variance reduction with unbiasedness: the regularized subspace information criterion for robust model selection in kernel regression.

A well-known result by Stein (1956) shows that in particular situations, biased estimators can yield better parameter estimates than their generally preferred unbiased counterparts. This letter follows the same spirit, as we will stabilize the unbiased generalization error estimates by regularization and finally obtain more robust model selection criteria for learning. We trade a small bias against a larger variance reduction, which has the beneficial effect of being more precise on a single training set. We focus on the subspace information criterion (SIC), which is an unbiased estimator of the expected generalization error measured by the reproducing kernel Hilbert space norm. SIC can be applied to the kernel regression, and it was shown in earlier experiments that a small regularization of SIC has a stabilization effect. However, it remained open how to appropriately determine the degree of regularization in SIC. In this article, we derive an unbiased estimator of the expected squared error, between SIC and the expected generalization error and propose determining the degree of regularization of SIC such that the estimator of the expected squared error is minimized. Computer simulations with artificial and real data sets illustrate that the proposed method works effectively for improving the precision of SIC, especially in the high-noise-level cases. We furthermore compare the proposed method to the original SIC, the cross-validation, and an empirical Bayesian method in ridge parameter selection, with good results.

Bayes Theorem↗

Bayesian fMRI data analysis with sparse spatial basis function priors.

In previous work we have described a spatially regularised General Linear Model (GLM) for the analysis of brain functional Magnetic Resonance Imaging (fMRI) data where Posterior Probability Maps (PPMs) are used to characterise regionally specific effects. The spatial regularisation is defined over regression coefficients via a Laplacian kernel matrix and embodies prior knowledge that evoked responses are spatially contiguous and locally homogeneous. In this paper we propose to finesse this Bayesian framework by specifying spatial priors using Sparse Spatial Basis Functions (SSBFs). These are defined via a hierarchical probabilistic model which, when inverted, automatically selects an appropriate subset of basis functions. The method includes non-linear wavelet shrinkage as a special case. As compared to Laplacian spatial priors, SSBFs allow for spatial variations in signal smoothness, are more computationally efficient and are robust to heteroscedastic noise. Results are shown on synthetic data and on data from an event-related fMRI experiment.

Algorithms↗

Software to compute and conduct sequential Bayesian phase I or II dose-ranging clinical trials with stopping rules.

The aim of dose-ranging phase I (resp. phase II) clinical trials is to rapidly identify the maximum tolerated dose (MTD) (resp., minimal effective dose (MED)) of a new drug or combination. For the conduct and analysis of such trials, Bayesian approaches such as the Continual Reassessment Method (CRM) have been proposed, based on a sequential design and analysis up to a completed fixed sample size. To optimize sample sizes, Zohar and Chevret have proposed stopping rules (Stat. Med. 20 (2001) 2827), the computation of which is not provided by available softwares. We present in this paper a user-friendly software for the design and analysis of these Bayesian Phase I (resp. phase II) dose-ranging Clinical Trials (BPCT). It allows to carry out the CRM with stopping rules or not, from the planning of the trial, with choice of model parameterization based on its operating characteristics, up to the sequential conduct and analysis of the trial, with estimation at stopping of the MTD (resp. MED) of the new drug or combination.

Bayes Theorem↗

Parallelized Bayesian inversion for three-dimensional dental X-ray imaging.

Diagnostic and operational tasks based on dental radiology often require three-dimensional (3-D) information that is not available in a single X-ray projection image. Comprehensive 3-D information about tissues can be obtained by computerized tomography (CT) imaging. However, in dental imaging a conventional CT scan may not be available or practical because of high radiation dose, low-resolution or the cost of the CT scanner equipment. In this paper, we consider a novel type of 3-D imaging modality for dental radiology. We consider situations in which projection images of the teeth are taken from a few sparsely distributed projection directions using the dentist's regular (digital) X-ray equipment and the 3-D X-ray attenuation function is reconstructed. A complication in these experiments is that the reconstruction of the 3-D structure based on a few projection images becomes an ill-posed inverse problem. Bayesian inversion is a well suited framework for reconstruction from such incomplete data. In Bayesian inversion, the ill-posed reconstruction problem is formulated in a well-posed probabilistic form in which a priori information is used to compensate for the incomplete information of the projection data. In this paper we propose a Bayesian method for 3-D reconstruction in dental radiology. The method is partially based on Kolehmainen et al. 2003. The prior model for dental structures consist of a weighted l1 and total variation (TV)-prior together with the positivity prior. The inverse problem is stated as finding the maximum a posteriori (MAP) estimate. To make the 3-D reconstruction computationally feasible, a parallelized version of an optimization algorithm is implemented for a Beowulf cluster computer. The method is tested with projection data from dental specimens and patient data. Tomosynthetic reconstructions are given as reference for the proposed method.

Algorithms↗

Bayesian estimation of dominance merits in noninbred populations by using Gibbs sampling with two reduced sets of mixed model equations.

Henderson's mixed model equations system is generally required in a Gibbs sampling application. In two previous studies, we proposed two indirect solving approaches that give dominance values in an animal model context with no need to process all this system. The first one does not require D-1 and the second is based on processing the additive animal model residuals. In the present work, we show that these two methods can be handled iteratively. Since the Bayesian approach is now a widely used tool in estimation of genetic parameters, the main part of this work is devoted to a Gibbs sampling application that can be accelerated by means of the aforementioned indirect solving methods. Three replicates of a population data set are simulated in the paper to compare the applications and estimates. This shows effectively that the estimates given by implementing a Gibbs sampler with each of the two suggested solving methods are obtained with less computational time and are comparable to those given by considering the integral system, particularly when priors are more weighted.

Bayes Theorem↗

Bayesian analysis of signaling networks governing embryonic stem cell fate decisions.

MOTIVATION: Signaling events that direct mouse embryonic stem (ES) cell self-renewal and differentiation are complex and accordingly difficult to understand in an integrated manner. We address this problem by adapting a Bayesian network learning algorithm to model proteomic signaling data for ES cell fate responses to external cues. Using this model we were able to characterize the signaling pathway influences as quantitative, logic-circuit type interactions. Our experimental dataset includes measurements for 28 signaling protein phosphorylation states across 16 different factorial combinations of cytokine and matrix stimuli as reported previously. RESULTS: The Bayesian network modeling approach allows us to uncover previously reported signaling activities related to mouse ES cell self-renewal, such as the roles of LIF and STAT3 in maintaining undifferentiated ES cell populations. Furthermore, the network predicts novel influences such as between ERK phosphorylation and differentiation, or RAF phosphorylation and differentiated cell proliferation. Visualization of the influences detected by the Bayesian network provides intuition about the underlying physiology of the signaling pathways. We demonstrate that the Bayesian networks can capture the linear, nonlinear and multistate logic interactions that connect extracellular cues, intracellular signals and consequent cell functional responses.

Algorithms↗

A novel strategy for microarray quality control using Bayesian networks.

MOTIVATION: High-throughput microarray technologies enable measurements of the expression levels of thousands of genes in parallel. However, microarray printing, hybridization and washing may create substantial variability in the quality of the data. As erroneous measurements may have a drastic impact on the results by disturbing the normalization schemes and by introducing expression patterns that lead to incorrect conclusions, it is crucial to discard low quality observations in the early phases of a microarray experiment. A typical microarray experiment consists of tens of thousands of spots on a microarray, making manual extraction of poor quality spots impossible. Thus, there is a need for a reliable and general microarray spot quality control strategy. RESULTS: We suggest a novel strategy for spot quality control by using Bayesian networks, which contain many appealing properties in the spot quality control context. We illustrate how a non-linear least squares based Gaussian fitting procedure can be used in order to extract features for a spot on a microarray. The features we used in this study are: spot intensity, size of the spot, roundness of the spot, alignment error, background intensity, background noise, and bleeding. We conclude that Bayesian networks are a reliable and useful model for microarray spot quality assessment. SUPPLEMENTARY INFORMATION: http://sigwww.cs.tut.fi/TICSP/SpotQuality/.

Algorithms↗

Reasoning requirements for diagnosis of heart disease.

Over the past dozen years, the Heart Disease Program (HDP) has been developed to assist physicians in reasoning about cardiovascular disorders. Driven by several evaluations, the inference mechanism has progressed from a logic based model, to a Bayesian Probability Network (BPN) and finally a pseudo-Bayesian network with temporal and severity reasoning. Though aspects of cardiovascular reasoning are handled well by BPNs, temporal reasoning, homeostatic feedback mechanisms and effects of disease severities require additional inference strategies. This article discusses how these reasoning problems are handled, and deals with closely linked issues in building the user interface to collect detailed cardiovascular data and provide clear explanations of diagnoses.

Artificial Intelligence↗

Deterministic and statistical methods for reconstructing multidimensional NMR spectra.

Reconstruction of an image from a set of projections is a well-established science, successfully exploited in X-ray tomography and magnetic resonance imaging. This principle has been adapted to generate multidimensional NMR spectra, with the key difference that, instead of continuous density functions, high-resolution NMR spectra comprise discrete features, relatively sparsely distributed in space. For this reason, a reliable reconstruction can be made from a small number of projections. This speeds the measurements by orders of magnitude compared to the traditional methodology, which explores all evolution space on a Cartesian grid, one step at a time. Speed is of crucial importance for structural investigations of biomolecules such as proteins and for the investigation of time-dependent phenomena. Whereas the recording of a suitable set of projections is a straightforward process, the reconstruction stage can be more problematic. Several practical reconstruction schemes are explored. The deterministic methods-additive back-projection and the lowest-value algorithm-derive the multidimensional spectrum directly from the experimental projections. The statistical search methods include iterative least-squares fitting, maximum entropy, and model-fitting schemes based on Bayesian analysis, particularly the reversible-jump Markov chain Monte Carlo procedure. These competing reconstruction schemes are tested on a set of six projections derived from the three-dimensional 700-MHz HNCO spectrum of a 187-residue protein (HasA) and compared in terms of reliability, absence of artifacts, sensitivity to noise, and speed of computation.

Journal Article↗

Bayesian statistics in medicine: a 25 year review.

This review examines the state of Bayesian thinking as Statistics in Medicine was launched in 1982, reflecting particularly on its applicability and uses in medical research. It then looks at each subsequent five-year epoch, with a focus on papers appearing in Statistics in Medicine, putting these in the context of major developments in Bayesian thinking and computation with reference to important books, landmark meetings and seminal papers. It charts the growth of Bayesian statistics as it is applied to medicine and makes predictions for the future. From sparse beginnings, where Bayesian statistics was barely mentioned, Bayesian statistics has now permeated all the major areas of medical statistics, including clinical trials, epidemiology, meta-analyses and evidence synthesis, spatial modelling, longitudinal modelling, survival modelling, molecular genetics and decision-making in respect of new technologies.

Bayes Theorem↗

Nonparametric AUC estimation in population studies with incomplete sampling: a Bayesian approach.

The estimation of the AUC in a population without frequent and/or fixed individual samplings is of interest because the number of plasma samples can often be limited due to technical, ethical and cost reasons. Non-linear mixed effect models can provide both population and individual estimates of AUC based on sparse sampling protocols; however, appropriate structural models for the description of the pharmacokinetics are required. Nonparametric solutions have also been proposed to estimate the population AUC and the associated error when particular sampling protocols are adopted. However, they do not estimate the individual AUCs and lack flexibility. Also a semiparametric method has been proposed for addressing the problem of sparse sampling in reasonably well designed studies. In this work, we propose and evaluate a nonparametric Bayesian scheme for AUC estimation in population studies with arbitrary sampling protocols. In the stochastic model representing the whole population, the individual plasma concentration curves and the "mean" population curve are described by random walk processes, allowing the application of the method to the reconstruction of any kind of "regular" curves. Population and individual AUC estimation are performed by numerically computing the posterior expectation through a Markov chain Monte Carlo algorithm.

Algorithms↗

A Bayesian approach for joint modeling of cluster size and subunit-specific outcomes.

In applications that involve clustered data, such as longitudinal studies and developmental toxicity experiments, the number of subunits within a cluster is often correlated with outcomes measured on the individual subunits. Analyses that ignore this dependency can produce biased inferences. This article proposes a Bayesian framework for jointly modeling cluster size and multiple categorical and continuous outcomes measured on each subunit. We use a continuation ratio probit model for the cluster size and underlying normal regression models for each of the subunit-specific outcomes. Dependency between cluster size and the different outcomes is accommodated through a latent variable structure. The form of the model facilitates posterior computation via a simple and computationally efficient Gibbs sampler. The approach is illustrated with an application to developmental toxicity data, and other applications, to joint modeling of longitudinal and event time data, are discussed.

Animals↗

Bayesian nonparametric modeling using mixtures of triangular distributions.

Nonparametric modeling is an indispensable tool in many applications and its formulation in an hierarchical Bayesian context, using the entire posterior distribution rather than particular expectations, increases its flexibility. In this article, the focus is on nonparametric estimation through a mixture of triangular distributions. The optimality of this methodology is addressed and bounds on the accuracy of this approximation are derived. Although our approach is more widely applicable, we focus for simplicity on estimation of a monotone nondecreasing regression on [0, 1] with additive error, effectively approximating the function of interest by a function having a piecewise linear derivative. Computationally accessible methods of estimation are described through an amalgamation of existing Markov chain Monte Carlo algorithms. Simulations and examples illustrate the approach.

Algorithms↗

Comparison between estimation of breeding values and fixed effects using Bayesian and empirical BLUP estimation under selection on parents and missing pedigree information.

Bayesian (via Gibbs sampling) and empirical BLUP (EBLUP) estimation of fixed effects and breeding values were compared by simulation. Combinations of two simulation models (with or without effect of contemporary group (CG)), three selection schemes (random, phenotypic and BLUP selection), two levels of heritability (0.20 and 0.50) and two levels of pedigree information (0% and 15% randomly missing) were considered. Populations consisted of 450 animals spread over six discrete generations. An infinitesimal additive genetic animal model was assumed while simulating data. EBLUP and Bayesian estimates of CG effects and breeding values were, in all situations, essentially the same with respect to Spearman's rank correlation between true and estimated values. Bias and mean square error (MSE) of EBLUP and Bayesian estimates of CG effects and breeding values showed the same pattern over the range of simulated scenarios. Methods were not biased by phenotypic and BLUP selection when pedigree information was complete, albeit MSE of estimated breeding values increased for situations where CG effects were present. Estimation of breeding values by Bayesian and EBLUP was similarly affected by joint effect of phenotypic or BLUP selection and randomly missing pedigree information. For both methods, bias and MSE of estimated breeding values and CG effects substantially increased across generations.

Alleles↗

A probabilistic rule-based expert system.

This paper explores a medical expert system combining techniques of Bayesian network modelling with ideas of weighted inference rules. The weights of the individual rules can be estimated objectively from a training set of actual cases; and they can be used in a Monte Carlo stimulation to estimate objectively conditional probabilities of diagnosis given particular combinations of symptoms. The paper describes and evaluates a medical expert system built according to this design. The diagnostic accuracy of the program was found to be similar to that obtained through the usual application of Bayes theorem with the assumption of conditional independence of symptoms given disease, even though the Bayesian classifier has more than 70 times as many numerical parameters. The method may be promising in cases where small training sets do not permit accurate estimation of large numbers of parameters.

Abdominal Pain↗

A Bayesian analysis of bivariate ordinal data: Wisconsin epidemiologic study of diabetic retinopathy revisited.

In many biomedical experiments one may often encounter bivariate data which are component-wise ordinal. The data set of the ophthalmologic experiment of the Wisconsin Epidemiologic Study of Diabetic Retinopathy (WESDR) is an example of such data. Several authors considered the analysis of such data from different viewpoints. The present work reviews the existing literature based on the WESDR data and on the basis of some latent variables provide the technique for analysing such data more easily in a Bayesian framework. Computation supports the methodology to a great extent. A comparison between our approach and the likelihood based approach considered by Kim has also been made.

Adult↗