Sciweavers

3050 search results - page 98 / 610
» On-line Algorithms in Machine Learning
Sort
View
118
Voted
ICML
2008
IEEE
16 years 4 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
ICML
2006
IEEE
16 years 4 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
115
Voted
COLING
2000
15 years 5 months ago
Application of Analogical Modelling to Example Based Machine Translation
This paper describes a self-modelling, incremental algorithm for learning translation rules from existing bilingual corpora. The notions of supracontext and subcontext are extende...
Christos Malavazosi, Stelios Piperidis
137
Voted
ICML
2002
IEEE
16 years 4 months ago
Active + Semi-supervised Learning = Robust Multi-View Learning
In a multi-view problem, the features of the domain can be partitioned into disjoint subsets (views) that are sufficient to learn the target concept. Semi-supervised, multi-view a...
Ion Muslea, Steven Minton, Craig A. Knoblock
ICML
2008
IEEE
16 years 4 months ago
Democratic approximation of lexicographic preference models
Previous algorithms for learning lexicographic preference models (LPMs) produce a "best guess" LPM that is consistent with the observations. Our approach is more democra...
Fusun Yaman, Thomas J. Walsh, Michael L. Littman, ...