Sciweavers

1252 search results - page 101 / 251
» Minimizing Learned Clauses
Sort
View
IIR
2010
15 years 5 months ago
Sentence-Based Active Learning Strategies for Information Extraction
Given a classifier trained on relatively few training examples, active learning (AL) consists in ranking a set of unlabeled examples in terms of how informative they would be, if ...
Andrea Esuli, Diego Marcheggiani, Fabrizio Sebasti...
NIPS
2007
15 years 5 months ago
Structured Learning with Approximate Inference
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
Alex Kulesza, Fernando Pereira
AAAI
2006
15 years 5 months ago
Using Homomorphisms to Transfer Options across Continuous Reinforcement Learning Domains
We examine the problem of Transfer in Reinforcement Learning and present a method to utilize knowledge acquired in one Markov Decision Process (MDP) to bootstrap learning in a mor...
Vishal Soni, Satinder P. Singh
IJCV
2011
264views more  IJCV 2011»
14 years 11 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
PAMI
2011
14 years 11 months ago
Semi-Supervised Learning via Regularized Boosting Working on Multiple Semi-Supervised Assumptions
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
Ke Chen, Shihai Wang