Bounding the generalization error of convex combinations of classifiers: balancing the dimensionality and the margins

This publication has 21 references indexed in Scilit:

• Bounds on margin distributions inBlearningBproblems
  Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 2003
• Empirical Margin Distributions and Bounding the Generalization Error of Combined Classifiers
  The Annals of Statistics, 2002
• Rademacher penalties and structural risk minimization
  IEEE Transactions on Information Theory, 2001
• About the constants in Talagrand's concentration inequalities for empirical processes
  The Annals of Probability, 2000
• Boosting the margin: a new explanation for the effectiveness of voting methods
  The Annals of Statistics, 1998
• Arcing classifier (with discussion and a rejoinder by the author)
  The Annals of Statistics, 1998
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
  IEEE Transactions on Information Theory, 1998
• Efficient algorithms for function approximation with piecewise linear sigmoidal networks
  IEEE Transactions on Neural Networks, 1998
• A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
  Journal of Computer and System Sciences, 1997
• Support-vector networks
  Machine Learning, 1995