Linear programming boosting by column and row generation

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimization problem. In preliminary experiments, our algorithm outperforms a state-of-the-art LP solver and LPBoost especially when the solution is given by a small set of relevant hypotheses and support vectors.

Original languageEnglish
Title of host publicationDiscovery Science - 12th International Conference, DS 2009, Proceedings
Pages401-408
Number of pages8
DOIs
Publication statusPublished - Nov 16 2009
Event12th International Conference on Discovery Science, DS 2009 - Porto, Portugal
Duration: Oct 3 2009Oct 5 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5808 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on Discovery Science, DS 2009
CountryPortugal
CityPorto
Period10/3/0910/5/09

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Linear programming boosting by column and row generation'. Together they form a unique fingerprint.

  • Cite this

    Hatano, K., & Takimoto, E. (2009). Linear programming boosting by column and row generation. In Discovery Science - 12th International Conference, DS 2009, Proceedings (pp. 401-408). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5808 LNAI). https://doi.org/10.1007/978-3-642-04747-3_32