đź”— Projet | | |
|
|
Session | Lecture | Idea/Concept |
1 | đź”— Lecture 1 | Basics |
→ Probabilité |
→ Variable aléatoire |
→ Chaine de Markov temps discret ordre 1 |
→ Théorème ergodique |
→ Absorption |
→ Etude d’une chaĂ®ne |
2 | đź”— Lecture 2 | Hidden Markov Chain |
→ Définitions |
→ Backward-Forward |
→ Viterbi |
→ Baum-Welch |
→ sklearn |
3 | đź”— Lecture 3 | Probabilistic automaton |
→ Automate probabiliste |
→ Automate de fréquence |
→ HMMT |
→ Merge & Fold |
→ Mots interdits |
→ ALERGIA |
| | |
|
REFERENCES |
Introduction to Algorithms: Cormen, T et Leiserson, C |
The Algorithm Design Manual: Steven S. Skiena |
Grammatical Inference: Learning Automata and Grammars: C. de la Higuera |