Concave learners for rankboost

MaRDI QIDQ3174099zbMATH OpenFDO

Authors Ofer Melnik, Yehuda Vardi, Cun-Hui Zhang

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v8/melnik07a.html

zbMATH Keywords

regularizationrankingrankboostconvex/concave

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}
• Margin-based ranking and an equivalence between AdaBoost and RankBoost
• 10.1162/1532443041827916
• BoostingTree: parallel selection of weak learners in boosting, with application to ranking
• Smooth Boosting for Margin-Based Ranking

Cited in

(2)

• \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}
• BoostingTree: parallel selection of weak learners in boosting, with application to ranking

This page was built for publication: Concave learners for rankboost

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