Sciweavers

63 search results - page 1 / 13
» Complexity Bounds for Batch Active Learning in Classificatio...
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 2 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
WWW
2006
ACM
14 years 5 months ago
Large-scale text categorization by batch mode active learning
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...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
JMLR
2010
143views more  JMLR 2010»
12 years 11 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii
ICML
2006
IEEE
14 years 5 months ago
Batch mode active learning and its application to medical image classification
Steven C. H. Hoi, Rong Jin, Jianke Zhu, Michael R....
CIKM
2010
Springer
13 years 2 months ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang