A stochastic search form of classification and regression tree (CART)
analysis (Breiman et al., 1984) is proposed, motivated by a Bayesian m
odel. An approximation to a probability distribution over the space of
possible trees is explored using reversible jump Markov chain Monte C
arlo methods (Green, 1995).