TY - GEN
T1 - Linear programming boosting by column and row generation
AU - Hatano, Kohei
AU - Takimoto, Eiji
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=71049179485&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=71049179485&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-04747-3_32
DO - 10.1007/978-3-642-04747-3_32
M3 - Conference contribution
AN - SCOPUS:71049179485
SN - 3642047467
SN - 9783642047466
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 401
EP - 408
BT - Discovery Science - 12th International Conference, DS 2009, Proceedings
T2 - 12th International Conference on Discovery Science, DS 2009
Y2 - 3 October 2009 through 5 October 2009
ER -