An efficient modified boosting method for solving classification problems
From MaRDI portal
Publication:2479397
Recommendations
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 3866350 (Why is no real title available?)
- scientific article; zbMATH DE number 1333813 (Why is no real title available?)
- scientific article; zbMATH DE number 1950578 (Why is no real title available?)
- A decision-theoretic generalization of on-line learning and an application to boosting
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Arcing classifiers. (With discussion)
- Bagging predictors
- Boosting a weak learning algorithm by majority
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
- Greedy function approximation: A gradient boosting machine.
- Soft margins for AdaBoost
- Stochastic gradient boosting.
Cited in
(9)- GA-Ensemble: a genetic algorithm for robust ensembles
- scientific article; zbMATH DE number 2101185 (Why is no real title available?)
- scientific article; zbMATH DE number 5284371 (Why is no real title available?)
- scientific article; zbMATH DE number 2043443 (Why is no real title available?)
- An improved boosting algorithm for small and imbalanced training sets
- A local boosting algorithm for solving classification problems
- AdaBoost algorithm using multi-step correction
- Supervised projection approach for boosting classifiers
- Improvement of boosting algorithm by modifying the weighting rule
This page was built for publication: An efficient modified boosting method for solving classification problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479397)