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 919 records · Page 51Linked to original sources
PubMed2006

[Noise image segmentation based on generalized fuzzy Gibbs random field].

In order to segment the blurred image with large noise, the authors propose a new Bayesian image segmentation method based on generalized fuzzy Gibbs random field. Based on the generalized fuzzy set, the new method introduces generalized fuzzy membership into Gibbs potential function and the potential function is redefined to obtain the new segmentation model. The optimal processing is executed through iterative conditional modes (ICM). The experiment results showed that the new approach could effectively segment the degenerated images.

Algorithms↗
PubMed2005

Replica-exchange Monte Carlo scheme for bayesian data analysis.

We develop a sampling algorithm to explore the probability densities arising in Bayesian data analysis problems. Our algorithm is a multiparameter generalization of a replica-exchange Monte Carlo scheme. The strategy relies on gradual weighing of experimental data and on Tsallis generalized statistics. We demonstrate the effectiveness of the method on nuclear magnetic resonance data for a folded protein.

Algorithms↗
PubMed2001

Bayesian methods of analysis for cluster randomized trials with binary outcome data.

We explore the potential of Bayesian hierarchical modelling for the analysis of cluster randomized trials with binary outcome data, and apply the methods to a trial randomized by general practice. An approximate relationship is derived between the intracluster correlation coefficient (ICC) and the between-cluster variance used in a hierarchical logistic regression model. By constructing an informative prior for the ICC on the basis of available information, we are thus able implicitly to specify an informative prior for the between-cluster variance. The approach also provides us with a credible interval for the ICC for binary outcome data. Several approaches to constructing informative priors from empirical ICC values are described. We investigate the sensitivity of results to the prior specified and find that the estimate of intervention effect changes very little in this data set, while its interval estimate is more sensitive. The Bayesian approach allows us to assume distributions other than normality for the random effects used to model the clustering. This enables us to gain insight into the robustness of our parameter estimates to the classical normality assumption. In a model with a more complex variance structure, Bayesian methods can provide credible intervals for a difference between two variance components, in order for example to investigate whether the effect of intervention varies across clusters. We compare our results with those obtained from classical estimation, discuss the relative merits of the Bayesian framework, and conclude that the flexibility of the Bayesian approach offers some substantial advantages, although selection of prior distributions is not straightforward.

Bayes Theorem↗
PubMed2001

Using linked markers to infer the age of a mutation.

Advances in sequencing and genotyping technologies over the last decade have enabled geneticists to easily characterize genetic variation at the nucleotide level. Hundreds of genes harboring mutations associated with genetic disease have now been identified by positional cloning. Using variation at closely linked genetic markers, it is possible to predict the times in the past at which particular mutations arose. Such studies suggest that many of the rare mutations underlying human genetic disorders are relatively young. Studies of variation at genetic markers linked to particular mutations can provide insights into human geographic history, and historical patterns of natural selection and disease, that are not available from other sources. We review two approaches for estimating allele age using variation at linked genetic markers. A phylogenetic approach aims to reconstruct the gene tree underlying a sample of chromosomes carrying a particular mutation, obtaining a "direct" estimate of allele age from the age of the root of this tree. A population genetic approach relies on models of demography, mutation, and/or recombination to estimate allele age without explicitly reconstructing the gene tree. Phylogenetic methods are best suited for studies of ancient mutations, while population genetic methods are better suited for studies of recent mutations. Methods that rely on recombination to infer the ages of alleles can be fine-tuned by choosing linked markers at optimal map distances to maximize the information available about allele age. A limitation of methods that rely on recombination is the frequent lack of a fine-scale linkage map. Maximum likelihood and Bayesian methods for estimating allele age that rely on intensive numerical computation are described, as well as "composite" likelihood and moment-based methods that lead to simple estimators. The former provide more accurate estimates (particularly for large samples of chromosomes) and should be employed if computationally practical.

Alleles↗
PubMed2026

TPMM: three-component posterior mixture model enables robust inverton detection in low-depth metagenomes and suggests potential viral invertons.

SUMMARY: Bacterial phase variation enables reversible, locus-specific phenotypic switching, often driven by DNA inversion (invertons). To identify these events, researchers commonly rely on sequencing reads that provide orientation-specific support. Metagenomic sequencing, which captures total genetic material independent of cultivation, offers a powerful platform for the comprehensive study of invertons. However, computational inverton calling from metagenomic data is difficult at low sequencing depth: hard read-support cutoffs can miss true events, while sequence-only predictors lack read-backed interpretability and uncertainty quantification. To address this, we present TPMM, a three-component posterior mixture model for inverton calling in metagenomic data. TPMM explicitly incorporates sequencing depth to formulate inverton detection as a probabilistic mixture problem. Starting from candidates flanked by inverted repeats, the model classifies the candidates into noise, low-probability, or high-probability inversion signals using read evidence. Finally, TPMM assigns posterior probabilities as soft labels and applies cumulative Bayesian False Discovery Rate control to robustly identify true invertons. On two real gut metagenomic datasets, TPMM agrees well with PhaseFinder at high depth but recovers substantially more invertons under systematic downsampling, demonstrating superior performance in sparse-data regimes. We further examine potential reversible inversion elements in viral genomes and provide supporting analyses, suggesting a broader scope for inversion-mediated regulation. AVAILABILITY: The source code of TPMM is available via: https://github.com/KennyxxD/TPMM.

Metagenomics↗
PubMed2006

Probabilistic mechanisms in sensorimotor control.

Uncertainty constitutes a fundamental constraint on human sensorimotor control. Our sensors are noisy and do not provide perfect information about all the properties of the world. Moreover, our muscles generate noisy outputs and many tasks we perform vary in an unpredictable way. Here we review the computations that the CNS uses in the face of such sensory, motor and task uncertainty. We show that the CNS reduces the uncertainty in estimates about the state of the world by using a Bayesian combination of prior knowledge and sensory feedback. It is shown that these mechanisms generalize to state estimation of ones own body during movement. We review how the CNS optimizes decisions based on these estimates, examining the error criterion that people optimize when performing targeted movements. Finally, we describe how signal-dependent noise on the motor output places constraints on performance. Goal-directed movement arises from a model in which the statistics of our actions are optimized. Together these studies provide a probabilistic framework for sensorimotor control.

Animals↗
PubMed1997

Comparison of two Bayesian approaches to dose-individualization for once-daily aminoglycoside regimens.

AIMS: Bayesian dose-individualization methods have been shown to have good predictive performance using minimal data points, and are now used widely in clinical practice. This study was designed to compare two computerised Bayesian dose-individualization methods, ABBOTTBASE and SeBA-GEN, in once-daily dosing of aminoglycosides. METHODS: ABBOTTBASE uses the maximum a posteriori estimator (MAP) algorithm which analyses all available serum drug concentration data for individual patients simultaneously, while the prior model remains unchanged. SeBA-GEN analyses each data set sequentially while continually modifying the individual patient's prior model, allowing within-patient variability to be modelled. One hundred consecutive patients who received once-daily dosing of aminoglycosides were prospectively dose-individualized using either of these methods. Retrospectively the alternative dosing method was used to provide comparative data. The ability of the methods to predict subsequent serum aminoglycoside concentration data was assessed in terms of their predictive performance, bias and precision. RESULTS: From the 100 patients, 277 serum aminoglycoside concentrations were available. Ninety-eight patients had serum concentrations available from the first dose and 55 from the second dose. Gentamicin was used in 96 patients. There was no significant bias when predicting peak concentrations from the prior model using either SeBA-GEN or ABBOTTBASE. The prior model used by ABBOTTBASE did, however, significantly underpredict the mid-dose concentration (mean bias = -0.79 mg l-1, 95% Confidence Interval [CI]: -1.3 to -0.3). When using the Bayesian algorithms for prediction of the second set of concentrations neither method was biased when predicting the peak concentration. ABBOTTBASE significantly overpredicted the mid-dose concentration (mean bias = 0.38 mg l-1, 95% CI: 0.03 to 0.74). The prior model used by SeBA-GEN was more precise at predicting both peak and mid-dose concentrations (P < 0.01), indicating better use of covariates. There was no difference between the methods in terms of estimation of the value of volume of distribution, but they differed significantly in the estimation of clearance (mean difference = 0.24 l h-1 for SeBA-GEN-ABBOTTBASE, 95% CI: 0.05 to 0.43). CONCLUSIONS: Bayesian techniques appear to work well with once-daily aminoglycoside dosing. The method of incorporation of individual patient information into the prior model appears to be important in the optimum choice of the first dose. SeBA-GEN has an advantage in this and in the lack of bias related to predicting low concentrations compared with ABBOTTBASE.

Algorithms↗
PubMed2000

Skeletal growth estimation using radiographic image processing and analysis.

An automated knowledge-based vision system for skeletal growth estimation in children is reported in this paper. Images were obtained from hand radiographs of 32 male and 25 female children of age 1-16 yr. Phalanx bones were automatically localized and segmented using hierarchical inferences and active shape models, respectively. A number of shape descriptors were obtained from the segmented bone contour to quantify skeletal growth. From these descriptors, a feature vector was selected for a regression model and a Bayesian estimator. The estimation accuracy was 84% for females and 82% for males. This level of accuracy is comparable to that of expert pediatric radiologists, which suggests that the proposed approach has a potential application in pediatric medicine.

Adolescent↗
PubMed2006

BayGO: Bayesian analysis of ontology term enrichment in microarray data.

BACKGROUND: The search for enriched (aka over-represented or enhanced) ontology terms in a list of genes obtained from microarray experiments is becoming a standard procedure for a system-level analysis. This procedure tries to summarize the information focussing on classification designs such as Gene Ontology, KEGG pathways, and so on, instead of focussing on individual genes. Although it is well known in statistics that association and significance are distinct concepts, only the former approach has been used to deal with the ontology term enrichment problem. RESULTS: BayGO implements a Bayesian approach to search for enriched terms from microarray data. The R source-code is freely available at http://blasto.iq.usp.br/~tkoide/BayGO in three versions: Linux, which can be easily incorporated into pre-existent pipelines; Windows, to be controlled interactively; and as a web-tool. The software was validated using a bacterial heat shock response dataset, since this stress triggers known system-level responses. CONCLUSION: The Bayesian model accounts for the fact that, eventually, not all the genes from a given category are observable in microarray data due to low intensity signal, quality filters, genes that were not spotted and so on. Moreover, BayGO allows one to measure the statistical association between generic ontology terms and differential expression, instead of working only with the common significance analysis.

Bacteria↗
PubMed2006

Time squared: repeated measures on phylogenies.

Studies of gene expression profiles in response to external perturbation generate repeated measures data that generally follow nonlinear curves. To explore the evolution of such profiles across a gene family, we introduce phylogenetic repeated measures (PR) models. These models draw strength from 2 forms of correlation in the data. Through gene duplication, the family's evolutionary relatedness induces the first form. The second is the correlation across time points within taxonic units, individual genes in this example. We borrow a Brownian diffusion process along a given phylogenetic tree to account for the relatedness and co-opt a repeated measures framework to model the latter. Through simulation studies, we demonstrate that repeated measures models outperform the previously available approaches that consider the longitudinal observations or their differences as independent and identically distributed by using deviance information criteria as Bayesian model selection tools; PR models that borrow phylogenetic information also perform better than nonphylogenetic repeated measures models when appropriate. We then analyze the evolution of gene expression in the yeast kinase family using splines to estimate nonlinear behavior across 3 perturbation experiments. Again, the PR models outperform previous approaches and afford the prediction of ancestral expression profiles. To demonstrate PR model applicability more generally, we conclude with a short examination of variation in brain development across 4 primate species.

Algorithms↗
PubMed2006

Application of the secondary structure model of rRNA for phylogeny: D2-D3 expansion segments of the LSU gene of plant-parasitic nematodes from the family Hoplolaimidae Filipjev, 1934.

Knowledge of rRNA structure is increasingly important to assist phylogenetic analysis through reconstructing optimal alignment, utilizing molecule features as an additional source of data and refining appropriate models of evolution of the molecule. We describe a procedure of optimization for alignment and a new coding method for nucleotide sequence data using secondary structure models of the D2 and D3 expansion fragments of the LSU-rRNA gene reconstructed for fifteen nematode species of the agriculturally important and diverse family Hoplolaimidae, order Tylenchida. Using secondary structure information we converted the original sequence data into twenty-eight symbol codes and submitted the transformed data to maximum parsimony analysis. We also applied the original sequence data set for Bayesian inference. This used the doublet model with sixteen states of nucleotide doublets for the stem region and the standard model of DNA substitution with four nucleotide states for loops and bulges. By this approach, we demonstrate that using structural information for phylogenetic analyses led to trees with lower resolved relationships between clades and likely eliminated some artefactual support for misinterpreted relationships, such as paraphyly of Helicotylenchus or Rotylenchus. This study as well as future phylogenetic analyses is herein supported by the development of an on-line database, NEMrRNA, for rRNA molecules in a structural format for nematodes. We also have developed a new computer program, RNAstat, for calculation of nucleotide statistics designed and proposed for phylogenetic studies.

Animals↗
PubMed2006

Bayesian wavelet-based image deconvolution: a GEM algorithm exploiting a class of heavy-tailed priors.

Image deconvolution is formulated in the wavelet domain under the Bayesian framework. The well-known sparsity of the wavelet coefficients of real-world images is modeled by heavy-tailed priors belonging to the Gaussian scale mixture (GSM) class; i.e., priors given by a linear (finite of infinite) combination of Gaussian densities. This class includes, among others, the generalized Gaussian, the Jeffreys, and the Gaussian mixture priors. Necessary and sufficient conditions are stated under which the prior induced by a thresholding/shrinking denoising rule is a GSM. This result is then used to show that the prior induced by the "nonnegative garrote" thresholding/shrinking rule, herein termed the garrote prior, is a GSM. To compute the maximum a posteriori estimate, we propose a new generalized expectation maximization (GEM) algorithm, where the missing variables are the scale factors of the GSM densities. The maximization step of the underlying expectation maximization algorithm is replaced with a linear stationary second-order iterative method. The result is a GEM algorithm of O(N log N) computational complexity. In a series of benchmark tests, the proposed approach outperforms or performs similarly to state-of-the art methods, demanding comparable (in some cases, much less) computational complexity.

Algorithms↗
PubMed2002

Prediction of protein solvent accessibility using support vector machines.

A Support Vector Machine learning system has been trained to predict protein solvent accessibility from the primary structure. Different kernel functions and sliding window sizes have been explored to find how they affect the prediction performance. Using a cut-off threshold of 15% that splits the dataset evenly (an equal number of exposed and buried residues), this method was able to achieve a prediction accuracy of 70.1% for single sequence input and 73.9% for multiple alignment sequence input, respectively. The prediction of three and more states of solvent accessibility was also studied and compared with other methods. The prediction accuracies are better than, or comparable to, those obtained by other methods such as neural networks, Bayesian classification, multiple linear regression, and information theory. In addition, our results further suggest that this system may be combined with other prediction methods to achieve more reliable results, and that the Support Vector Machine method is a very useful tool for biological sequence analysis.

Bayes Theorem↗
PubMed2006

Combining wavelet analysis and Bayesian networks for the classification of auditory brainstem response.

The auditory brainstem response (ABR) has become a routine clinical tool for hearing and neurological assessment. In order to pick out the ABR from the background EEG activity that obscures it, stimulus-synchronized averaging of many repeated trials is necessary, typically requiring up to 2000 repetitions. This number of repetitions can be very difficult, time consuming and uncomfortable for some subjects. In this study, a method combining wavelet analysis and Bayesian networks is introduced to reduce the required number of repetitions, which could offer a great advantage in the clinical situation. 314 ABRs with 64 repetitions and 155 ABRs with 128 repetitions recorded from eight subjects are used here. A wavelet transform is applied to each of the ABRs, and the important features of the ABRs are extracted by thresholding and matching the wavelet coefficients. The significant wavelet coefficients that represent the extracted features of the ABRs are then used as the variables to build the Bayesian network for classification of the ABRs. In order to estimate the performance of this approach, stratified ten-fold cross-validation is used.

Algorithms↗
PubMed2001

Bayesian haplotype inference for multiple linked single-nucleotide polymorphisms.

Haplotypes have gained increasing attention in the mapping of complex-disease genes, because of the abundance of single-nucleotide polymorphisms (SNPs) and the limited power of conventional single-locus analyses. It has been shown that haplotype-inference methods such as Clark's algorithm, the expectation-maximization algorithm, and a coalescence-based iterative-sampling algorithm are fairly effective and economical alternatives to molecular-haplotyping methods. To contend with some weaknesses of the existing algorithms, we propose a new Monte Carlo approach. In particular, we first partition the whole haplotype into smaller segments. Then, we use the Gibbs sampler both to construct the partial haplotypes of each segment and to assemble all the segments together. Our algorithm can accurately and rapidly infer haplotypes for a large number of linked SNPs. By using a wide variety of real and simulated data sets, we demonstrate the advantages of our Bayesian algorithm, and we show that it is robust to the violation of Hardy-Weinberg equilibrium, to the presence of missing data, and to occurrences of recombination hotspots.

Algorithms↗
PubMed2005

Analytical form for a Bayesian wavelet estimator of images using the Bessel K form densities.

A novel Bayesian nonparametric estimator in the Wavelet domain is presented. In this approach, a prior model is imposed on the wavelet coefficients designed to capture the sparseness of the wavelet expansion. Seeking probability models for the marginal densities of the wavelet coefficients, the new family of Bessel K forms (BKF) densities are shown to fit very well to the observed histograms. Exploiting this prior, we designed a Bayesian nonlinear denoiser and we derived a closed form for its expression. We then compared it to other priors that have been introduced in the literature, such as the generalized Gaussian density (GGD) or the alpha-stable models, where no analytical form is available for the corresponding Bayesian denoisers. Specifically, the BKF model turns out to be a good compromise between these two extreme cases (hyperbolic tails for the alpha-stable and exponential tails for the GGD). Moreover, we demonstrate a high degree of match between observed and estimated prior densities using the BKF model. Finally, a comparative study is carried out to show the effectiveness of our denoiser which clearly outperforms the classical shrinkage or thresholding wavelet-based techniques.

Algorithms↗
PubMed2003

Estimation of the Hemodynamic Response Function in event-related functional MRI: directed acyclic graphs for a general Bayesian inference framework.

A convenient way to analyze BOLD fMRI data consists of modeling the whole brain as a stationary, linear system characterized by its transfer function: the Hemodynamic Response Function (HRF). HRF estimation, though of the greatest interest, is still under investigation, for the problem is ill-conditioned. In this paper, we recall the most general Bayesian model for HRF estimation and show how it can beneficially be translated in terms of graphical models, leading to (i) a clear and efficient representation of all structural and functional relationships entailed by the model, and (ii) a straightforward numerical scheme to approximate the joint posterior distribution, allowing for estimation of the HRF, as well as all other model parameters. We finally apply this novel technique on both simulations and real data.

Adolescent↗
PubMed1998

An investigation of neural networks in thyroid function diagnosis.

We investigate the potential of artificial neural networks in diagnosing thyroid diseases. The robustness of neural networks with regard to sampling variations is examined using a cross-validation method. We illustrate the link between neural networks and traditional Bayesian classifiers. Neural networks can provide good estimates of posterior probabilities and hence can have better classification performance than traditional statistical methods such as logistic regression. The neural network models are further shown to be robust to sampling variations. It is demonstrated that for medical diagnosis problems where the data are often highly unbalanced, neural networks can be a promising classification method for practical use.

Bayes Theorem↗