|
|||||
|
|
On the Computational Complexity of Approximating Distributions by Probabilistic Automata |
|
| Authors: | Abe Naoki Warmuth Manfred K |
| Affiliation: | (1) Information Basic Research Laboratory, C&C Information Technology Research Laboratories, NEC Corporation, 4-1-1 Miyazaki, Miyamae-ku, Kawasaki, 216, Japan;(2) Computer Engineering and Information Sciences, University of California, Santa Cruz, CA, 95064 |
| Abstract: | Machine Learning - We introduce a rigorous performance criterion for training algorithms for probabilistic automata (PAs) and hidden Markov models (HMMs), used extensively for speech recognition,... |
| Keywords: | Hidden Markov models PAC learning model density estimation Kullback-Leibler divergence computational learning theory |
| 本文献已被 SpringerLink 等数据库收录！ | |
