Bayesian CART model search

Journal of the American Statistical Association

Volumn 93, Issue 443, 1998, Pages 935-948

  Chipman, Hugh A ^a   George, Edward I ^b   McCulloch, Robert E ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c UNIVERSITY OF CHICAGO   (United States)

Author keywords

Binary trees; Markov chain Monte Carlo; Mixture models; Model selection; Model uncertainty; Stochastic search

Indexed keywords

EID: 0032346848     PISSN: 01621459     EISSN: 1537274X     Source Type: Journal    
DOI: 10.1080/01621459.1998.10473750     Document Type: Article

References (19)

1. Breiman, L., Friedman, J., Olshen, R., and Stone, C. (1984), Classification and Regression Trees, Belmont. CA: Wadsworth.
2. Breiman, L. (1996), "Bagging Predictors," Machine Learning, 24, 123-140.
3. Buntine, W. (1992), "Learning Classification Trees," Statistics and Computing, 2, 63-73.
4. Clark, L., and Pregibon, D. (1992), 'Tree-Based Models" in Statistical Models in S, eds. J. Chambers and T. Hastie, Belmont, CA: Wadsworth.
5. Chipman, H. A., George, E. I., and McCulloch, R. E. (1998), "Hierarchical Priors for Bayesian CART Shrinkage," Working Paper 98-03, University of Waterloo, Dept, of Statistics and Actuarial Science.
6. Denison, D. G. T., Mallick, B. K., and Smith, A. F. M. (in press), "A Bayesian CART Algorithm," Biometrika, 85.
7. George, E. I. (1998), "Bayesian Model Selection," in Encyclopedia of Statistical Sciences Update, Vol. 3, New York: Wiley.
8. Green, P. (1995), "Reversible Jump Markov Chain Monte Carlo Computation and Bayesian Model Determination," Biometrika, 82, 711-732.
9. Jordan, M. I., and Jacobs, R. A. (1994), "Mixtures of Experts and the EM Algorithm," Neural Computation, 6, 181-214.
10. Lutsko, J. F., and Kuijpers, B. (1994), "Simulated Annealing in the Construction of Near-Optimal Decision Trees," in Selecting Models From Data: AI and Statistics TV, eds. P. Cheeseman and R. W. Oldford, New York: Springer-Verlag, pp. 453-462.
11. Mallows, C. L. (1973), "Some Comments on Cp" Technometrics, 15, 661-676.
12. Oliver, J. J., and Hand. D. J. (1995), "On Pruning and Averaging Decision Trees," in Proceedings of the International Machine Learning Conference, pp. 430-437.
13. Paass, G., and Kindermann, J. (1997), "Describing the Uncertainty of Bayesian Predictions By Using Ensembles of Models and Its Application," in 1997 Real World Computing Symposium, Real World Computing Partnership, Tsukuba Research Center, Tsukuba, Japan, pp. 118-125.
14. Quinlan, J. R., and Rivest, R. L. (1989), "Inferring Decision Trees Using the Minimum Description Length Principle," Information and Computation, 80, 227-248.
15. Sutton, C. (1991), "Improving Classification Trees With Simulated Annealing," in Proceedings of the 23rd Symposium on the Interface, ed. E. Keramidas, Interface Foundation of North America.
16. Tibshirani, R., and Knight, K. (1995), "Model Search and Inference by Bootstrap 'Bumping," technical report, University of Toronto.
17. Tierney, L. (1994), "Markov Chains for Exploring Posterior Distributions," The Annals of Statistics, 22, 1701-1762.
18. Wallace, C. C., and Patrick, J. D. (1993), "Coding Decision Trees," Machine Learning, 11, 7-22.
19. Wolberg, W. H., and Mangasarian, O. L. (1990), "Multisurface Method of Pattern Separation for Medical Diagnosis Applied to Breast Cytology," Proceedings of the National Academy of Sciences, 87, 9193-9196.