1454 search results - page 43 / 291 » Learning and Extending Sublanguages |
100
click to vote
ACL
2008
15 years 3 months ago
2008
We extend the classical single-task active learning (AL) approach. In the multi-task active learning (MTAL) paradigm, we select examples for several annotation tasks rather than f...
103
click to vote
NIPS
2007
15 years 3 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
AAAI
1994
15 years 3 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
IPL
2010
15 years 13 days ago
2010
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
105
click to vote
ML
2008
ACM
15 years 1 months ago
2008
ACM
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. Hitherto existing approaches to label ranking implicitly operat...