43 search results - page 2 / 9 » Learning Stochastic Finite Automata from Experts |
ICGI
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. The present paper presents a new approach of how to convert Gold-style [4] learning in the limit into stochastically finite learning with high confidence. We illustrate t...
COLT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
ASC
2011
13 years 7 days ago
2011
: PSO, like many stochastic search methods, is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. I...
RIA
2006
13 years 5 months ago
2006
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...