11 search results - page 1 / 3 » Ordering by weighted number of wins gives a good ranking for... |
TALG
2010
13 years 7 months ago
2010
ECCC
2006
13 years 8 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
ALENEX
2009
13 years 6 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
ECIR
2008
Springer
13 years 10 months ago
2008
Springer
Many traditional information retrieval models, such as BM25 and language modeling, give good retrieval effectiveness, but can be difficult to implement efficiently. Recently, docum...