395 search results - page 2 / 79 » Learning to rank with partially-labeled data |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
GFKL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A central task when integrating data from different sources is to detect identical items. For example, price comparison websites have to identify offers for identical p...
IJCV
2011
13 years 2 months ago
2011
Abstract We present an active learning framework that predicts the tradeoff between the effort and information gain associated with a candidate image annotation, thereby ranking un...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Active learning strategies can be useful when manual labeling
effort is scarce, as they select the most informative
examples to be annotated first. However, for visual category
...
EMNLP
2009
13 years 5 months ago
2009
There have been increasing needs for task specific rankings in web search such as rankings for specific query segments like long queries, time-sensitive queries, navigational quer...