Exploiting independence for branch operations in Bayesian learning of CRTs

Nicos Angelopoulos; James Cussens

Exploiting independence for branch operations in Bayesian learning of CRTs

Nicos Angelopoulos, James Cussens

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

In this paper we extend a methodology for Bayesian learning via MCMC, with the ability to grow arbitrarily long branches in C&RT models. We are able to do so by exploiting independence in the model construction process. The ability to grow branches rather than single nodes has been noted as desirable in the literature. The most singular feature of the underline methodology used here in comparison to other approaches is the coupling of the prior and the proposal. The main contribution of this paper is to show how taking advantage of independence in the coupled process, can allow branch growing and swapping for proposal models.

Original language	Undefined/Unknown
Publication status	Published - 2005

Access to Document

http://drops.dagstuhl.de/opus/volltexte/2006/415

Cite this

@conference{26300beecd6d4c41b41fc146b4f0d401,

title = "Exploiting independence for branch operations in Bayesian learning of CRTs",

abstract = "In this paper we extend a methodology for Bayesian learning via MCMC, with the ability to grow arbitrarily long branches in C&RT models. We are able to do so by exploiting independence in the model construction process. The ability to grow branches rather than single nodes has been noted as desirable in the literature. The most singular feature of the underline methodology used here in comparison to other approaches is the coupling of the prior and the proposal. The main contribution of this paper is to show how taking advantage of independence in the coupled process, can allow branch growing and swapping for proposal models. ",

author = "Nicos Angelopoulos and James Cussens",

year = "2005",

language = "Undefined/Unknown",

}

TY - CONF

T1 - Exploiting independence for branch operations in Bayesian learning of CRTs

AU - Angelopoulos, Nicos

AU - Cussens, James

PY - 2005

Y1 - 2005

N2 - In this paper we extend a methodology for Bayesian learning via MCMC, with the ability to grow arbitrarily long branches in C&RT models. We are able to do so by exploiting independence in the model construction process. The ability to grow branches rather than single nodes has been noted as desirable in the literature. The most singular feature of the underline methodology used here in comparison to other approaches is the coupling of the prior and the proposal. The main contribution of this paper is to show how taking advantage of independence in the coupled process, can allow branch growing and swapping for proposal models.

AB - In this paper we extend a methodology for Bayesian learning via MCMC, with the ability to grow arbitrarily long branches in C&RT models. We are able to do so by exploiting independence in the model construction process. The ability to grow branches rather than single nodes has been noted as desirable in the literature. The most singular feature of the underline methodology used here in comparison to other approaches is the coupling of the prior and the proposal. The main contribution of this paper is to show how taking advantage of independence in the coupled process, can allow branch growing and swapping for proposal models.

M3 - Paper

ER -