Sciweavers

12194 search results - page 329 / 2439
» Numberings Optimal for Learning
Sort
View
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
16 years 7 months ago
IMMC: incremental maximum margin criterion
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
Jun Yan, Benyu Zhang, Shuicheng Yan, Qiang Yang, H...
DSMML
2004
Springer
16 years 2 days ago
Can Gaussian Process Regression Be Made Robust Against Model Mismatch?
Learning curves for Gaussian process (GP) regression can be strongly affected by a mismatch between the ‘student’ model and the ‘teacher’ (true data generation process), e...
Peter Sollich
ECML
2006
Springer
15 years 10 months ago
Task-Driven Discretization of the Joint Space of Visual Percepts and Continuous Actions
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
Sébastien Jodogne, Justus H. Piater
GECCO
2011
Springer
236views Optimization» more  GECCO 2011»
14 years 10 months ago
Online, GA based mixture of experts: a probabilistic model of ucs
In recent years there have been efforts to develop a probabilistic framework to explain the workings of a Learning Classifier System. This direction of research has met with lim...
Narayanan Unny Edakunni, Gavin Brown, Tim Kovacs
COMBINATORICS
2004
105views more  COMBINATORICS 2004»
15 years 6 months ago
An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
Micah Coleman