Smooth Boosting for Margin-Based Ranking

DOI10.1007/978-3-540-87987-9_21MaRDI QIDQ3529924zbMATH OpenOpenAlexFDO

Authors Jun-Ichi Moribe, Kohei Hatano, Masayuki Takeda, Eiji Takimoto

Publication date 14 October 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87987-9_21

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Margin-based ranking and an equivalence between AdaBoost and RankBoost
• Learning Theory
• \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}
• Learning Theory
• Analysis of boosting algorithms using the smooth margin function

Cited in

(7)

• BoostingTree: parallel selection of weak learners in boosting, with application to ranking
• \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}
• Row and column generation algorithm for maximization of minimum margin for ranking problems
• Margin-based ranking and an equivalence between AdaBoost and RankBoost
• Concave learners for rankboost
• Smooth Boosting Using an Information-Based Criterion
• Learning Theory

This page was built for publication: Smooth Boosting for Margin-Based Ranking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3529924)