354 search results - page 17 / 71 » Top-k learning to rank: labeling, ranking and evaluation |
TSD
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Evaluation is one of the hardest tasks in automatic text summarization. It is perhaps even harder to determine how much a particular component of a summarization system c...
HICSS
2006
IEEE
15 years 3 months ago
2006
IEEE
The classical (ad hoc) document retrieval problem has been traditionally approached through ranking according to heuristically developed functions (such as tf.idf or bm25) or gene...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
ECIR
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Active learning refers to the task of devising a ranking function that, given a classifier trained from relatively few training examples, ranks a set of additional unlabe...
NAACL
2010
14 years 7 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...