Model Search by Bootstrap “Bumping”

Journal of Computational and Graphical Statistics

Volumn 8, Issue 4, 1999, Pages 671-686

  Tibshiran, Robert ^a   Knight, Keith ^b  

^a STANFORD LAW SCHOOL   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Bootstrap; Confidence sets; Resistant fitting; Stochastic search

Indexed keywords

EID: 0033266602     PISSN: 10618600     EISSN: 15372715     Source Type: Journal    
DOI: 10.1080/10618600.1999.10474842     Document Type: Article

References (11)

1. Breiman, L. (1996), ‘Bagging Predictors,” Machine Learning, 123-140.
2. Breiman, L., Friedman, J., Olshen, R., and Stone, C. (1984), Classification and Regression Trees, Belmont, CA: Wadsworth.
3. Chipman, H., George, E., and McCulloch, R. (1998), “Bayesian Cart Model Search” (with discussion), Journal of the American Statistical Association, 92, 935-960.
4. Clark, L., and Pregibon, D. (1991), ‘Tree-Based Models,” in Statistical Models in S, eds. J. Chambers and T. Hastie, Belmont, CA: Wadsworth.
5. Efron, B. (1979), “Bootstrap Methods: Another Look at the Jackknife,” The Annals of Statistics, 7, 1-26.
6. Efron, B., and Tibshirani, R. (1993), An Introduction to the Bootstrap, New York: Chapman and Hall.
7. Friedman, J., Hastie, T., and Tibshirani, R. (1998), “Additive Logistic Regression: A Statistical View of Boosting,” Technical Report, Stanford University.
8. Hall, P. (1992), The Bootstrap and Edgeworth Expansion, New York: Springer-Verlag.
9. Kim, J., and Pollard, D. (1990), “Cube Root Asymptotics,” The Annals of Statistics, 11, 191-219.
10. Rousseeuw, P. (1984), “Least Median of Squares Regression,” Journal of the American Statistical Association, 79, 871-880.
11. Schapire, R., and Freund, Y. (1997), “Boosting the Margin: A New Explanation for the Effectiveness of Voting Methods,” in Proceedings of the 14th International Conference on Machine Learning.