Learning a priori constrained weighted majority votes
DOI10.1007/S10994-014-5462-ZzbMATH Open1319.68168OpenAlexW2107560177MaRDI QIDQ2512901FDOQ2512901
Amaury Habrard, Marc Sebban, Emilie Morvant, Aurélien Bellet
Publication date: 2 February 2015
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-014-5462-z
Recommendations
- Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm
- The weighted majority algorithm
- A weight-adjusted voting algorithm for ensembles of classifiers
- Combining predictions in pairwise classification: an optimal adaptive voting strategy and its relation to weighted voting
- scientific article
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Voting theory (91B12)
Cites Work
- Distance metric learning for large margin nearest neighbor classification
- Random forests
- Bagging predictors
- Pattern classification.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved boosting algorithms using confidence-rated predictions
- Computer Vision - ECCV 2004
- Learning Theory and Kernel Machines
- Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
- Tighter PAC-Bayes bounds through distribution-dependent priors
- Title not available (Why is that?)
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
Cited In (3)
Uses Software
This page was built for publication: Learning a priori constrained weighted majority votes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2512901)
