Creator |
|
|
Language |
|
Publisher |
|
Date |
|
Source Title |
|
Vol |
|
First Page |
|
Last Page |
|
Conference |
|
Publication Type |
|
Access Rights |
|
Related DOI |
|
Related DOI |
|
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 e...xperiments, 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.show more
|