395 search results - page 5 / 79 » Learning to rank with partially-labeled data |
120
click to vote
NAACL
2010
14 years 11 months ago
2010
Most learning algorithms for undirected graphical models require complete inference over at least one instance before parameter updates can be made. SampleRank is a rankbased lear...
161
click to vote
ALT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
110
click to vote
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...
113
click to vote
KDD
2005
ACM
16 years 2 months ago
2005
ACM
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
98
Voted
PAMI
2008
15 years 1 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...