3694 search results - page 358 / 739 » Stochastic complexity in learning |
182
click to vote
ECAL
2005
Springer
16 years 7 days ago
2005
Springer
We present an example of the dynamical systems approach to learning and adaptation. Our goal is to explore how both control and learning can be embedded into a single dynamical sys...
148
click to vote
CEC
2003
IEEE
15 years 12 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
216
click to vote
COLT
2003
Springer
15 years 12 months ago
2003
Springer
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ï¬...
147
click to vote
ILP
1998
Springer
15 years 11 months ago
1998
Springer
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
168
click to vote
CIDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...