Boosting products of base classifiers

@inproceedings{Kgl2009BoostingPO,
  title={Boosting products of base classifiers},
  author={Bal{\'a}zs K{\'e}gl and R{\'o}bert Busa-Fekete},
  booktitle={ICML},
  year={2009}
}
In this paper we show how to boost products of simple base learners. Similarly to trees, we call the base learner as a subroutine but in an iterative rather than recursive fashion. The main advantage of the proposed method is its simplicity and computational efficiency. On benchmark datasets, our boosted products of decision stumps clearly outperform boosted trees, and on the MNIST dataset the algorithm achieves the second best result among no-domain-knowledge algorithms after deep belief nets… CONTINUE READING
Highly Cited
This paper has 96 citations. REVIEW CITATIONS

6 Figures & Tables

Topics

Statistics

020402009201020112012201320142015201620172018
Citations per Year

97 Citations

Semantic Scholar estimates that this publication has 97 citations based on the available data.

See our FAQ for additional information.