Some results on weakly accurate base learners for boosting regression and classification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1857 LNCS, Issue , 2000, Pages 87-96

  Jiang, Wenxin ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; ALGORITHMS;

BASE LEARNERS; BOOSTING ALGORITHM; CLASSIFICATION SYSTEM; EXPONENTIAL CONVERGENCE RATE; GEOMETRIC CONCEPTS; HYPOTHESIS SPACE; TRAINING ERRORS;

REGRESSION ANALYSIS;

EID: 84867069706     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45014-9_8     Document Type: Conference Paper

References (16)

1. BREIMAN, L. (1998). Arcing classifiers. The Annals of Statistics, 26 801-849.
2. BREIMAN, L. (1997a). Prediction games and arcing classifiers. Technical Report 504, Statistics Department, University of California at Berkeley, 1997.
3. BREIMAN, L. (1997b). Arcing the edge. Technical Report 486, Statistics Department, University of California at Berkeley, 1997.
4. FREUND, Y. (1995). Boosting a weak learning algorithm by majority. Information and Computation, 121 256-285.
5. FREUND, Y. and SCHAPIRE, R. E. (1996). Game theory, on-line prediction and boosting. Proceedings of the Ninth Annual Conference on Computational Learning Theory, 325-332.
6. FREUND, Y. and SCHAPIRE, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55 119-139.
7. FRIEDMAN, J. H. (1999). Greedy function approximation: a gradient boosting machine. Technical Report, Department of Statistics, Stanford University.
8. FRIEDMAN, J., HASTIE, T. AND TIBSHIRANI, R. (1999). Additive logistic regression: a statistical view of boosting. Technical Report, Department of Statistics, Stanford University.
9. GOLDMANN, M., HASTAD, J., AND RAZBOROV, A. (1992). Majority gates vs. general weighted threshold gates. Computational Complexity, 2 277-300.
10. JACOBS, R. A., JORDAN, M. I., NOWLAN, S. J., AND HINTON, G. E. (1991). Adaptive mixtures of local experts. Neural Comp. 3 79-87.
11. JIANG, W. (1999). Large time behavior of boosting algorithms for regression and classification. Technical Report, Department of Statistics, Northwestern University.
12. JIANG, W. (2000). On weak base learners for boosting regression and classification. Technical Report, Department of Statistics, Northwestern University.
13. MASON, L., BAXTER, J., BARTLETT, P. AND FREAN, M. Boosting algorithms as gradient descent in function space. Technical Report, Department of Systems Engineering, Australian National University.
14. SCHAPIRE, R. E. (1990). The strength of weak learnability. Machine Learning, 5 197-227.
15. SCHAPIRE, R. E. (1999). Theoretical views of boosting. Computational Learning Theory: Fourth European Conference, EuroCOLT'99, 1-10.
16. SCHAPIRE, R. E., FREUND, Y., BARTLETT, P. AND LEE, W. S. (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics, 26 1651-1686.