A more robust boosting algorithm Export

@article{Freund:2009, abstract = {We present a new boosting algorithm, motivated by the large margins theory for boosting. We give experimental evidence that the new algorithm is significantly more robust against label noise than existing boosting algorithm.}, archivePrefix = {arXiv}, author = {Freund, Yoav}, citeulike-article-id = {4522171}, citeulike-linkout-0 = {http://arxiv.org/abs/0905.2138}, citeulike-linkout-1 = {http://arxiv.org/pdf/0905.2138}, comment = {Pre-print for ICML 2009}, eprint = {0905.2138}, keywords = {boosting, convexity, margin, robustness}, month = {May}, posted-at = {2009-05-15 08:19:34}, priority = {4}, title = {A more robust boosting algorithm}, url = {http://arxiv.org/abs/0905.2138}, year = {2009} }

TY - JOUR ID - Freund:2009 L3 - citeulike-article-id:4522171 N2 - We present a new boosting algorithm, motivated by the large margins theory for boosting. We give experimental evidence that the new algorithm is significantly more robust against label noise than existing boosting algorithm. TI - A more robust boosting algorithm KW - boosting KW - convexity KW - margin KW - robustness N1 - Pre-print for ICML 2009 AU - Freund, Yoav PY - 2009/May/13/ UR - http://arxiv.org/abs/0905.2138 ER -