An efficient algorithm for learning to rank from preference graphs (Q1959647): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10994-008-5097-z / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ml/PahikkalaTAJB09 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10994-008-5097-Z / rank | |||
Normal rank | |||
Latest revision as of 15:26, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for learning to rank from preference graphs |
scientific article |
Statements
An efficient algorithm for learning to rank from preference graphs (English)
0 references
7 October 2010
0 references
ranking
0 references
preference learning
0 references
preference graph
0 references
regularized least-squares
0 references
kernel methods
0 references
