version française rss feed
HAL : inria-00428905, version 1

Voir la fiche détaillée  BibTeX,EndNote,...
26th International Conference on Machine Learning (ICML 2009), Montreal : Canada (2009)
Boosting products of base classifiers
Balázs Kégl1, 2, 3, Róbert Busa-Fekete1

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.
1 :  LAL - Laboratoire de l'Accélérateur Linéaire
2 :  INRIA Saclay - Ile de France - TAO
3 :  LRI - Laboratoire de Recherche en Informatique