Abstract
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distributions over data. SoftRankBoost provably achieves approximately the maximum soft margin over all pairs of positive and negative examples, which implies high AUC score for future data.
Original language | English |
---|---|
Pages (from-to) | 227-239 |
Number of pages | 13 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 5254 LNAI |
DOIs | |
Publication status | Published - 2008 |
Event | 19th International Conference on Algorithmic Learning Theory, ALT 2008 - Budapest, Hungary Duration: Oct 13 2008 → Oct 16 2008 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science