Use of majority votes in statistical learning
From MaRDI portal
Cites work
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Bagging predictors
- Bayes Factors
- Bayesian model averaging: A tutorial. (with comments and a rejoinder).
- Boosting algorithms: regularization, prediction and model fitting
- Boosting with early stopping: convergence and consistency
- Boosting With theL2Loss
- Combining Pattern Classifiers
- Greedy function approximation: A gradient boosting machine.
- High-dimensional graphs and variable selection with the Lasso
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 3666738 (Why is no real title available?)
- scientific article; zbMATH DE number 1865745 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 5046126 (Why is no real title available?)
- Majority Voting by Independent Classifiers Can Increase Error Rates
- Measuring the accuracy of diagnostic systems
- New multicategory boosting algorithms based on multicategory Fisher-consistent losses
- Random forests
- Random lasso
- Sparse boosting
- Stability selection. With discussion and authors' reply
- Stochastic gradient boosting.
- The Adaptive Lasso and Its Oracle Properties
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Use of majority votes in statistical learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604473)
