76 search results - page 6 / 16 » Negative Results for Active Learning with Convex Losses |
ECIR
2009
Springer
14 years 5 months ago
2009
Springer
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...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
ML
2007
ACM
13 years 7 months ago
2007
ACM
Which active learning methods can we expect to yield good performance in learning binary and multi-category logistic regression classifiers? Addressing this question is a natural ...