Sciweavers

79 search results - page 5 / 16
» Active learning of label ranking functions
Sort
View
NIPS
2007
15 years 10 days ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
92
Voted
IJCV
2011
264views more  IJCV 2011»
14 years 5 months ago
Cost-Sensitive Active Visual Category Learning
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...
Sudheendra Vijayanarasimhan, Kristen Grauman
WWW
2008
ACM
15 years 11 months ago
Ranking refinement and its application to information retrieval
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
Rong Jin, Hamed Valizadegan, Hang Li
126
Voted
CVPR
2009
IEEE
16 years 6 months ago
What's It Going to Cost You?: Predicting Effort vs. Informativeness for Multi-Label Image Annotations
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 ...
Sudheendra Vijayanarasimhan (University of Texas a...
ECIR
2009
Springer
15 years 8 months ago
Active Sampling for Rank Learning via Optimizing the Area under the ROC Curve
Abstract. Learning ranking functions is crucial for solving many problems, ranging from document retrieval to building recommendation systems based on an individual user’s prefer...
Pinar Donmez, Jaime G. Carbonell