Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
From MaRDI portal
Publication:463372
DOI10.1134/S0005117914040067zbMATH Open1297.90106OpenAlexW2000232071MaRDI QIDQ463372FDOQ463372
Authors: M. I. Poberii, M. Yu. Khachaĭ 
Publication date: 16 October 2014
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117914040067
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
- Boosting a weak learning algorithm by majority
- Title not available (Why is that?)
- Boosting. Foundations and algorithms.
- Computational complexity of the minimum committee problem and related problems
- Committees of systems of linear inequalities
- Constraint elimination method for the committee problem
- Parallel computations and committee constructions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
Uses Software
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)
