Boosting products of base classifiers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Boosting products of base classifiers

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.
No file

Dates and versions

inria-00428905 , version 1 (29-10-2009)

Identifiers

  • HAL Id : inria-00428905 , version 1

Cite

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⟩
1663 View
0 Download

Share

Gmail Facebook X LinkedIn More