Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
From MaRDI portal
Publication:463372
Recommendations
- Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
- scientific article; zbMATH DE number 2086343
- scientific article; zbMATH DE number 6873727
- scientific article; zbMATH DE number 1944955
- Some theory for generalized boosting algorithms
- scientific article; zbMATH DE number 2089370
- scientific article; zbMATH DE number 2086353
- A primal-dual convergence analysis of boosting
- Optimization by Gradient Boosting
Cites work
- scientific article; zbMATH DE number 5598224 (Why is no real title available?)
- scientific article; zbMATH DE number 3819777 (Why is no real title available?)
- scientific article; zbMATH DE number 42573 (Why is no real title available?)
- scientific article; zbMATH DE number 193776 (Why is no real title available?)
- scientific article; zbMATH DE number 5181446 (Why is no real title available?)
- Boosting a weak learning algorithm by majority
- Boosting. Foundations and algorithms.
- Committees of systems of linear inequalities
- Computational complexity of the minimum committee problem and related problems
- Constraint elimination method for the committee problem
- Parallel computations and committee constructions
Cited in
(2)
This page was built for publication: Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463372)