12 search results - page 1 / 3 » Learning Probabilistic Automata with Variable Memory Length |
COLT
1994
Springer
13 years 8 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
ICMLA
2008
13 years 6 months ago
2008
Mining for outliers in sequential databases is crucial to forward appropriate analysis of data. Therefore, many approaches for the discovery of such anomalies have been proposed. ...
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
14 years 1 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
ENTCS
2007
13 years 4 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
COLT
1998
Springer
13 years 9 months ago
1998
Springer
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...