65 search results - page 7 / 13 » A bound on the label complexity of agnostic active learning |
WWW
2006
ACM
14 years 8 months ago
2006
ACM
Large-scale text categorization is an important research topic for Web data mining. One of the challenges in large-scale text categorization is how to reduce the amount of human e...
NIPS
1996
13 years 9 months ago
1996
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The sample complexity of active learning under the realizability assumption has been well-studied. The realizability assumption, however, rarely holds in practice. In this paper, ...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Multi-view learning has become a hot topic during the past few years. In this paper, we first characterize the sample complexity of multi-view active learning. Under the expansion...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
Data-driven Spoken Language Understanding (SLU) systems need semantically annotated data which are expensive, time consuming and prone to human errors. Active learning has been su...