Stability and Generalization of Bipartite Ranking Algorithms
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 32-47
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Learnability of Bipartite Ranking Functions2005
- General conditions for predictivity in learning theoryNature, 2004
- Regularization Networks and Support Vector MachinesAdvances in Computational Mathematics, 2000
- 10.1162/jmlr.2003.4.6.933Applied Physics Letters, 2000
- 10.1162/153244302760200704Applied Physics Letters, 2000
- Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-ValidationNeural Computation, 1999
- Learning to Order ThingsJournal of Artificial Intelligence Research, 1999
- On the method of bounded differences1989
- Distribution-free performance bounds for potential function rulesIEEE Transactions on Information Theory, 1979
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability & Its Applications, 1971