Divide, conquer, combine Bayesian decision tree sampling
From MaRDI portal
Cites work
- A Bayesian CART algorithm
- Bayesian regression tree ensembles that adapt to smoothness and sparsity
- Bayesian treed Gaussian process models with an application to computer modeling
- Dynamic trees for learning and design
- Efficient Metropolis-Hastings proposal mechanisms for Bayesian regression tree models
- Equation of state calculations by fast computing machines
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- Marginal Likelihood Computation for Model Selection and Hypothesis Testing: An Extensive Review
- Monte Carlo sampling methods using Markov chains and their applications
- The no-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
This page was built for publication: Divide, conquer, combine Bayesian decision tree sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7392255)