Sökning: "Bayesian model averaging"
Visar resultat 1 - 5 av 8 avhandlingar innehållade orden Bayesian model averaging.
1. Model Selection and Sparse Modeling
Sammanfattning : Parametric signal models are used in a multitude of signal processing applications. This thesis deals with signals for which there are many candidate models, and it is not a priori known which model is the most appropriate one. LÄS MER
2. Bayesian Phylogenetics and the Evolution of Gall Wasps
Sammanfattning : This thesis concerns the phylogenetic relationships and the evolution of the gall-inducing wasps belonging to the family Cynipidae. Several previous studies have used morphological data to reconstruct the evolution of the family. LÄS MER
3. Essays on forecasting and Bayesian model averaging
Sammanfattning : This thesis, which consists of four chapters, focuses on forecasting in a data-rich environment and related computational issues. Chapter 1, “An embarrassment of riches: Forecasting using large panels” explores the idea of combining forecasts from various indicator models by using Bayesian model averaging (BMA) and compares the predictive performance of BMA with predictive performance of factor models. LÄS MER
4. Learning local predictive accuracy for expert evaluation and forecast combination
Sammanfattning : This thesis consists of four papers that study several topics related to expert evaluation and aggregation. Paper I explores the properties of Bayes factors. Bayes factors, which are used for Bayesian hypothesis testing as well as to aggregate models using Bayesian model averaging, are sometimes observed to behave erratically. LÄS MER
5. Bayesian inference in probabilistic graphical models
Sammanfattning : This thesis consists of four papers studying structure learning and Bayesian inference in probabilistic graphical models for both undirected and directed acyclic graphs (DAGs).Paper A presents a novel algorithm, called the Christmas tree algorithm (CTA), that incrementally construct junction trees for decomposable graphs by adding one node at a time to the underlying graph. LÄS MER