On the learnability of hidden markov models

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2484, Issue , 2002, Pages 261-268

  Terwijn, Sebastiaan A ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Complexity; Hidden Markov models; Pac learning

Indexed keywords

COMPUTATIONAL GRAMMARS; INFERENCE ENGINES; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; TRELLIS CODES;

COMPLEXITY; COMPLEXITY THEORY; CRYPTOGRAPHIC ASSUMPTIONS; LEARNABILITY; PAC LEARNING;

HIDDEN MARKOV MODELS;

EID: 84907301232     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45790-9_21     Document Type: Conference Paper

References (13)

1. M. Anthony and N. Biggs, Computational learning theory: An introduction, Cambridge University Press, 1992.
2. P. Baldi and Y. Chauvin, Smooth on-line learning algorithms for hidden Markov models, Neural Computation 6 (1994) 307-318.
3. L. E. Baum, An inequality and associated maximization technique in statistical estimation for probabilistic functions of a Markov process, Inequalities 3, 1972, 1-8.
4. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. of the ACM 36(4), 929-965, 1989.
5. E. Charniak, Statistical Language Learning, MIT Press, 1993.
6. P. Clote and R. Backofen, Computational molecular biology: An introduction, Wiley, 2000.
7. O. Goldreich, S. Goldwasser, and S. Micali, How to construct random functions, J. of the ACM 33(4) (1986) 792-807.
8. M. J. Kearns, The computational complexity of machine learning, MIT Press, 1990.
9. M. J. Kearns and L. G. Valiant, Cryptographic limitations on learning boolean formulae and finite automata, J. of the ACM 41(1) (1994) 67-95.
10. M. J. Kearns, U. V. Vazirani, An introduction to computational learning theory, MIT Press, 1994.
11. M. Kharitonov, Cryptographic hardness of distribution-specific learning, Proc. 25th ACM Symp. on the Theory of Computing, 372-381, ACM Press, N. Y., 1993.
12. L. Pitt and M. K. Warmuth, Prediction-preserving reducibility, J. Computer and System Sci. 41(3) (1990) 430-467.
13. L. G. Valiant, A theory of the learnable, Communications of the ACM 27(11) (1984) 1134-1142.