The \(p\)-norm push: a simple convex ranking algorithm that concentrates at the top of the list (Q2880971)
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: The p-norm push: a simple convex ranking algorithm that concentrates at the top of the list |
scientific article; zbMATH DE number 6025108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(p\)-norm push: a simple convex ranking algorithm that concentrates at the top of the list |
scientific article; zbMATH DE number 6025108 |
Statements
17 April 2012
0 references
ranking
0 references
RankBoost
0 references
generalization bounds
0 references
Roc
0 references
information retrieval
0 references
The \(p\)-norm push: a simple convex ranking algorithm that concentrates at the top of the list (English)
0 references
0.973791241645813
0 references
0.7863625288009644
0 references
0.7533901929855347
0 references
0.7497524619102478
0 references
