An efficient algorithm for learning to rank from preference graphs (Q1959647): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10994-008-5097-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2139039274 / rank | |||
Normal rank | |||
Revision as of 14:21, 19 March 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
