Generalization performance of bipartite ranking algorithms with convex losses (Q488690)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalization performance of bipartite ranking algorithms with convex losses |
scientific article; zbMATH DE number 6390623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalization performance of bipartite ranking algorithms with convex losses |
scientific article; zbMATH DE number 6390623 |
Statements
Generalization performance of bipartite ranking algorithms with convex losses (English)
0 references
26 January 2015
0 references
bipartite ranking
0 references
generalization bound
0 references
Rademacher complexity
0 references
reproducing kernel Hilbert space
0 references
0 references
0.8444404006004333
0 references
0.8372424840927124
0 references
0.8315802812576294
0 references
0.8169434666633606
0 references
