In this article we put forward a Bayesian approach for finding classification and regression tree (CART) models. The two basic components of this approach consist of prior specification and stochastic search. The basic idea is to have the prior induce a posterior distribution that will guide the stochastic search toward more promising CART models. As the search proceeds, such models can then be selected with a variety of criteria, such as posterior probability, marginal likelihood, residual sum of squares or misclassification rates. Examples are used to illustrate the potential superiority of this approach over alternative methods
The problem of variable selection in regression and the generalised linear model is addressed. We a...
In this PhD thesis problems of Bayesian model selection and model averaging are addressed in various...
Motivation: Approximate Bayesian computation (ABC) methods provide an elaborate approach to Bayesian...
In principle, the Bayesian approach to model selection is straightforward. Prior probability distrib...
The Bayesian CART (classification and regression tree) approach proposed by Chipman, George and McCu...
this paper is to provide a Bayesian alternative to the CART procedure by regarding the number of spl...
A general method for defining informative priors on statistical models is presented and applied sp...
When simple parametric models such as linear regression fail to adequately approximate a relationshi...
Trees have long been used as a flexible way to build regression and classification models for comple...
Trees have long been used as a flexible way to build regression and classification models for comple...
We develop a Bayesian “sum-of-trees” model, named BART, where each tree is constrained by a prior to...
This thesis first describes the general idea behind Bayes Inference, various sampling methods based ...
Submitted in partial fulfilment of the requirements for the degree of Master of Philosophy at Queen ...
Frequentist methods for learning Gaussian graphical model structure are unsuccessful at identifying ...
AbstractThis note describes a Bayesian model selection or optimization procedure for post hoc infere...
The problem of variable selection in regression and the generalised linear model is addressed. We a...
In this PhD thesis problems of Bayesian model selection and model averaging are addressed in various...
Motivation: Approximate Bayesian computation (ABC) methods provide an elaborate approach to Bayesian...
In principle, the Bayesian approach to model selection is straightforward. Prior probability distrib...
The Bayesian CART (classification and regression tree) approach proposed by Chipman, George and McCu...
this paper is to provide a Bayesian alternative to the CART procedure by regarding the number of spl...
A general method for defining informative priors on statistical models is presented and applied sp...
When simple parametric models such as linear regression fail to adequately approximate a relationshi...
Trees have long been used as a flexible way to build regression and classification models for comple...
Trees have long been used as a flexible way to build regression and classification models for comple...
We develop a Bayesian “sum-of-trees” model, named BART, where each tree is constrained by a prior to...
This thesis first describes the general idea behind Bayes Inference, various sampling methods based ...
Submitted in partial fulfilment of the requirements for the degree of Master of Philosophy at Queen ...
Frequentist methods for learning Gaussian graphical model structure are unsuccessful at identifying ...
AbstractThis note describes a Bayesian model selection or optimization procedure for post hoc infere...
The problem of variable selection in regression and the generalised linear model is addressed. We a...
In this PhD thesis problems of Bayesian model selection and model averaging are addressed in various...
Motivation: Approximate Bayesian computation (ABC) methods provide an elaborate approach to Bayesian...