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 language | English |
|---|---|
| Title of host publication | Discovery Science - 12th International Conference, DS 2009, Proceedings |
| Pages | 401-408 |
| Number of pages | 8 |
| DOIs | |
| Publication status | Published - Nov 16 2009 |
| Event | 12th International Conference on Discovery Science, DS 2009 - Porto, Portugal Duration: Oct 3 2009 → Oct 5 2009 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 5808 LNAI |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 12th International Conference on Discovery Science, DS 2009 |
|---|---|
| Country | Portugal |
| City | Porto |
| Period | 10/3/09 → 10/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