A markovian approach to the induction of regular string distributions

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

Volumn 3264, Issue , 2004, Pages 77-90

  Callut, Jérôme ^a   Dupont, Pierre ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

HMM topology induction; Lumped Markov process; Mean first passage time; Partially observable Markov model; State splitting algorithm

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; COMPUTATIONAL GRAMMARS; ELECTRON TRANSITIONS; INFERENCE ENGINES; ITERATIVE METHODS; MARKOV PROCESSES; MAXIMUM LIKELIHOOD; TOPOLOGY;

HIDDEN MARKOV MODEL (HMM); HMM TOPOLOGY INDUCTION; LUMPED MARKOV PROCESS; MEAN FIRST PASSAGE TIME; PARTIALLY OBSERVABLE MARKOV MODEL; STATE SPLITTING ALGORITHM;

MARKOV PROCESSES; HIDDEN MARKOV MODELS;

EID: 22944485670     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30195-0_8     Document Type: Conference Paper

References (19)

1. R. Carrasco and J. Oncina. Learning deterministic regular gramars from stochastic samples in polynomial time. Theoretical Informatics and Applications, 33(1):1-19, 1999.
2. F. Denis and Y. Esposito. Learning classes of probabilistic automata. In Proc. of 17th Annual Conference on Learning Theory (COLT), number 3120 in Lecture Notes in Computer Science, pages 124-139, Banff, Canada, 2004. Springer Verlag.
3. P. Dupont and J.C. Amengual. Smoothing probabilistic automata: an error-correcting approach. In A. Oliveira, editor, Grammatical Inference: Algorithms and Applications, number 1891 in Lecture Notes in Artificial Intelligence, pages 51-64, Lisbon, Portugal, 2000. Springer Verlag.
4. P. Dupont and L. Chase. Using symbol clustering to improve probabilistic automaton inference. In Grammatical Inference, ICGI'98, number 1433 in Lecture Notes in Artificial Intelligence, pages 232-243, Ames, Iowa, 1998. Springer Verlag.
5. P. Dupont, F. Denis, and Y. Esposito. Links between Probabilistic Automata and Hidden Markov Models: probability distributions, learning models and induction algorithms. Pattern Recognition, 2004. to appear in Special Issue on Grammatical Inference Techniques & Applications.
6. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological sequence analysis. Cambridge University Press, 1998.
7. D. Freitag and A. McCallum. Information extraction with hmms and shrinkage. In Proc. of the AAAI-99 Workshop on Machine Learning for Information Extraction, 1999.
8. D. Freitag and A. McCallum. Information extraction with HMM structures learned by stochastic optimization. In Proc. of the Seventeenth National Conference on Artificial Intelligence, AAAI, pages 584-589, 2000.
9. J.G. Kemeny and J.L. Snell. Finite Markov Chains. Springer-Verlag, 1983.
10. C. Kermorvant and P. Dupont. Stochastic grammatical inference with multinomial tests. In P. Adriaans, H. Fernau, and M. van Zaanen, editors, Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications, number 2484 in Lecture Notes in Artificial Intelligence, pages 149-160, Amsterdam, the Netherlands, September 2002. Springer Verlag.
11. E. Levin and R. Pieraccini. Planar hidden markov modeling: from speech to optical character recognition. In C.L. Giles, S.J. Hanton, and J.D. Cowan, editors, Advances in Neural Information Processing Systems, volume 5, pages 731-738. Morgan Kauffman, 1993.
12. D. Llorens, J.-M. Vilar, and F. Casacuberta. Finite state language models smoothed using n-grams. International Journal of Pattern Recognition and Artificial Intelligence, 16(3):275-289, 2002.
13. J. R. Norris. Markov Chains. Cambridge University Press, United Kingdom, 1997.
14. M. Ostendorf and H. Singer. Hmm topology design using maximum likelihood successive state splitting. Computer Speech and Language, 11:17-41, 1997.
15. L. Rabiner and B.-H. Juang. Fundamentals of Speech Recognition. Prentice-Hall, 1993.
16. D. Ron, Y. Singer, and N. Tishby. Learning probabilistic automata with variable memory length. In Proceedings of the Seventh Annual Conference on Computational Learning Theory, New Brunswick, NJ, 1994. ACM Press.
17. H. Rulot and E. Vidai. An efficient algorithm for the inference of circuit-free automata. In G. Ferratè, T. Pavlidis, A. Sanfeliu, and H. Bunke, editors, Advances in Structural and Syntactic Pattern Recognition, pages 173-184. NATO ASI, Springer-Verlag, 1988.
18. A. Stolcke. Bayesian Learning of Probabilistic Language Models. Ph. D. dissertation, University of California, 1994.
19. F. Thollard, P. Dupont, and G. de la Higuera. Probabilistic DFA Inference using Kullback-Leibler Divergence and Minimality. In Seventeenth International Conference on Machine Learning, pages 975-982. Morgan Kauffman, 2000.