Skip to Main content Skip to Navigation
Conference papers

Boosting products of base classifiers

Balázs Kégl 1, 2, 3 Róbert Busa-Fekete 1 
2 TAO - Machine Learning and Optimisation
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : 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. As a second contribution, we present an improved base learner for nominal features and show that boosting the product of two of these new subset indicator base learners solves the maximum margin matrix factorization problem used to formalize the collaborative filtering task. On a small benchmark dataset, we get experimental results comparable to the semi-definite-programming-based solution but at a much lower computational cost.
Document type :
Conference papers
Complete list of metadata
Contributor : Balázs Kégl Connect in order to contact the contributor
Submitted on : Thursday, October 29, 2009 - 7:00:33 PM
Last modification on : Sunday, June 26, 2022 - 11:50:47 AM


  • HAL Id : inria-00428905, version 1



Balázs Kégl, Róbert Busa-Fekete. Boosting products of base classifiers. 26th International Conference on Machine Learning (ICML 2009), Jun 2009, Montreal, Canada. pp.497-504. ⟨inria-00428905⟩



Record views