Margin-based ranking and an equivalence between AdaBoost and RankBoost
From MaRDI portal
Publication:2880970
Recommendations
Cited in
(18)- Learning Theory
- On equivalence relationships between classification and ranking algorithms
- Approximation analysis of gradient descent algorithm for bipartite ranking
- scientific article; zbMATH DE number 6253924 (Why is no real title available?)
- Smooth Boosting for Margin-Based Ranking
- One-pass AUC optimization
- Interpretable machine learning: fundamental principles and 10 grand challenges
- \textsc{Rankboost} \(+\): an improvement to \textsc{Rankboost}
- 10.1162/1532443041827916
- Concave learners for rankboost
- Sequential event prediction
- The convergence rate of a regularized ranking algorithm
- A review on instance ranking problems in statistical learning
- scientific article; zbMATH DE number 7370578 (Why is no real title available?)
- BoostingTree: parallel selection of weak learners in boosting, with application to ranking
- Generalization performance of bipartite ranking algorithms with convex losses
- Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
- Row and column generation algorithms for minimum margin maximization of ranking problems
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)