Improved generalization through explicit optimization of margins

DOI10.1023/A:1007697429651zbMath0954.68134OpenAlexW1597529531MaRDI QIDQ1568529

Jonathan Baxter, Llew Mason, Bartlett, Peter L.

Publication date: 5 February 2001

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1007697429651

zbMATH Keywords

voting methodsbootstingmargins analysis

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (14)

Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins. ⋮ A MapReduce-based distributed SVM ensemble for scalable image classification and annotation ⋮ An analysis of diversity measures ⋮ Noise peeling methods to improve boosting algorithms ⋮ Pruning of error correcting output codes by optimization of accuracy-diversity trade off ⋮ Unnamed Item ⋮ The synergy between PAV and AdaBoost ⋮ DOOMRED: a new optimization technique for boosted cascade detectors on enforced training set ⋮ GA-Ensemble: a genetic algorithm for robust ensembles ⋮ The synergy between PAV and AdaBoost ⋮ A note on margin-based loss functions in classification ⋮ Supervised projection approach for boosting classifiers ⋮ Robust support vector machines for multiple instance learning ⋮ A re-weighting strategy for improving margins

This page was built for publication: Improved generalization through explicit optimization of margins