The Consistency of Greedy Algorithms for Classification

This publication has 13 references indexed in Scilit:

• On the Existence of Linear Weak Learners and Applications to Boosting
  Machine Learning, 2002
• Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
  Published by Springer Nature ,2001
• Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)
  The Annals of Statistics, 2000
• On the optimality of neural-network approximation using incremental algorithms
  IEEE Transactions on Neural Networks, 2000
• Neural Network Learning
  Published by Cambridge University Press (CUP) ,1999
• Minimax nonparametric classification .I. Rates of convergence
  IEEE Transactions on Information Theory, 1999
• Arcing classifier (with discussion and a rejoinder by the author)
  The Annals of Statistics, 1998
• A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
  Journal of Computer and System Sciences, 1997
• Weak Convergence and Empirical Processes
  Published by Springer Nature ,1996
• Convergence of Stochastic Processes
  Published by Springer Nature ,1984