1106 search results - page 32 / 222 » On regularization algorithms in learning theory |
123
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...
148
Voted
DAGSTUHL
1996
15 years 5 months ago
1996
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making decisions about the present based only on knowledge of the past. Although these area...
121
click to vote
COLT
2005
Springer
15 years 10 months ago
2005
Springer
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
119
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
Many classes of image data span a low dimensional nonlinear space embedded in the natural high dimensional image space. We adopt and generalize a recently proposed dimensionality ...
136
Voted
ICGI
2010
Springer
15 years 5 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...