Sciweavers

9886 search results - page 202 / 1978
» Learning Compressible Models
Sort
View
ICML
2007
IEEE
16 years 4 months ago
A bound on the label complexity of agnostic active learning
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
Steve Hanneke
121
Voted
NAACL
2010
15 years 1 months ago
Painless Unsupervised Learning with Features
We show how features can easily be added to standard generative models for unsupervised learning, without requiring complex new training methods. In particular, each component mul...
Taylor Berg-Kirkpatrick, Alexandre Bouchard-C&ocir...
FOCS
2003
IEEE
15 years 8 months ago
Learning DNF from Random Walks
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
ECTEL
2008
Springer
15 years 5 months ago
A Goal-oriented Authoring Approach to Design, Share and Reuse Learning Scenarios
This paper presents our research works and our proposal : ISiS model (Intentions, Strategies, interactional Situations), a conceptual framework elaborated to structure the design o...
Valérie Emin
77
Voted
EUSFLAT
2007
115views Fuzzy Logic» more  EUSFLAT 2007»
15 years 4 months ago
Training Neurofuzzy Networks with Participatory Learning
This paper introduces a new approach to adjust a class of neurofuzzy networks based on the idea of participatory learning. Participatory learning is a mean to learn and revise bel...
Michel Hell, Rosangela Ballini, Pyramo Costa Jr., ...