scientific article; zbMATH DE number 1804107

MaRDI QIDQ3148809zbMATH OpenFDO

Authors D. Panchenko, Fernando Lozano, Vladimir Koltchinskii

Publication date 22 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2111/21110241

Mathematics Subject Classification ID

Computational learning theory (68Q32) Applications of game theory (91A80)

Recommendations

• Boosting the margin: a new explanation for the effectiveness of voting methods
• Further results on the margin explanation of boosting: new algorithm and experiments
• Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins.
• Empirical margin distributions and bounding the generalization error of combined classifiers
• On the doubt about margin explanation of boosting

Cited in

(10)

• Voting with preferences over margins of victory
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Empirical margin distributions and bounding the generalization error of combined classifiers
• On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
• Correction to: ``Weighted scoring elections: is Borda best?
• Boosting with early stopping: convergence and consistency
• A methodological note on a weighted voting experiment
• Generalization bounds for voting classifiers based on sparsity and clustering.
• Combining predictions in pairwise classification: an optimal adaptive voting strategy and its relation to weighted voting
• On the generalization error of fixed combinations of classifiers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148809)