Margin-based ranking and an equivalence between AdaBoost and RankBoost
From MaRDI portal
Publication:2880970
zbMATH Open1235.68186MaRDI QIDQ2880970FDOQ2880970
Authors: Cynthia Rudin, Robert E. Schapire 
Publication date: 17 April 2012
Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)
Full work available at URL: http://www.jmlr.org/papers/v10/rudin09a.html
Recommendations
Cited In (18)
- \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}
- 10.1162/1532443041827916
- On equivalence relationships between classification and ranking algorithms
- One-pass AUC optimization
- A review on instance ranking problems in statistical learning
- Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
- Title not available (Why is that?)
- BoostingTree: parallel selection of weak learners in boosting, with application to ranking
- Title not available (Why is that?)
- Concave learners for rankboost
- Row and column generation algorithms for minimum margin maximization of ranking problems
- Approximation analysis of gradient descent algorithm for bipartite ranking
- Smooth Boosting for Margin-Based Ranking
- Learning Theory
- The convergence rate of a regularized ranking algorithm
- Interpretable machine learning: fundamental principles and 10 grand challenges
- Generalization performance of bipartite ranking algorithms with convex losses
- Sequential event prediction
This page was built for publication: Margin-based ranking and an equivalence between AdaBoost and RankBoost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880970)
