ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
14 years 9 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...
106
click to vote
ICDE
2008
IEEE
15 years 2 months ago
2008
IEEE
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...