421 search results - page 33 / 85 » Reducing Label Complexity by Learning From Bags |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, we describe methods to exploit search queries mined from search engine query logs to improve domain detection in spoken language understanding. We propose extending...
71
Voted
NIPS
2007
14 years 11 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...
KDD
2010
ACM
14 years 11 months ago
2010
ACM
Active learning (AL) is an increasingly popular strategy for mitigating the amount of labeled data required to train classifiers, thereby reducing annotator effort. We describe ...
COLT
2000
Springer
15 years 2 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
AH
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. A Learning Design(LD) definition under the IMS-LD standard is a complex task for the instructor because it requires a lot of time, effort and previous knowledge of the ...