Sciweavers

165 search results - page 30 / 33
» Teaching Randomized Learners
Sort
View
COLT
2004
Springer
14 years 1 months ago
Learning a Hidden Graph Using O(log n) Queries Per Edge
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
Dana Angluin, Jiang Chen
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
13 years 11 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
ECML
2006
Springer
13 years 11 months ago
Active Learning with Irrelevant Examples
Abstract. Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there ma...
Dominic Mazzoni, Kiri Wagstaff, Michael C. Burl
CICLING
2010
Springer
13 years 11 months ago
ETL Ensembles for Chunking, NER and SRL
We present a new ensemble method that uses Entropy Guided Transformation Learning (ETL) as the base learner. The proposed approach, ETL Committee, combines the main ideas of Baggin...
Cícero Nogueira dos Santos, Ruy Luiz Milidi...
NIPS
2003
13 years 9 months ago
Approximate Policy Iteration with a Policy Language Bias
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...
Alan Fern, Sung Wook Yoon, Robert Givan