888 search results - page 31 / 178 » Learning to Select a Ranking Function |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
ICML
1998
IEEE
14 years 8 months ago
1998
IEEE
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
KDD
1998
ACM
14 years 3 days ago
1998
ACM
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Naive Bayes is an effective and efficient learning algorithm in classification. In many applications, however, an accurate ranking of instances based on the class probability is m...
AIRS
2005
Springer
14 years 1 months ago
2005
Springer
Query expansion techniques generally select new query terms from a set of top ranked documents. Although a user’s manual judgment of those documents would much help to select goo...