2100 search results - page 45 / 420 » Learning to rank on graphs |
WSDM
2009
ACM
15 years 4 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
COMBINATORICA
2010
14 years 4 months ago
2010
We prove that every rayless graph has an unfriendly partition.
SIGIR
2006
ACM
15 years 3 months ago
2006
ACM
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must ...
ECIR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. As retrieval systems become more complex, learning to rank approaches are being developed to automatically tune their parameters. Using online learning to rank approaches...
4OR
2005
14 years 9 months ago
2005
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...