🔗 Project | ||

Session | Reading | Idea / Concept |

1 | 🔗 Reading 1 | Basics |

→ Probability | ||

→ Random variable | ||

→ Markov chain discrete time order 1 | ||

→ Theorem ergodic | ||

→ Absorption | ||

→ Study of a chain | ||

2 | 🔗 Reading 2 | Hidden Markov Chain |

→ Definitions | ||

→ Backward-Forward | ||

→ Viterbi | ||

→ Baum-Welch | ||

→ sklearn | ||

3 | 🔗 Reading 3 | Probabilistic automaton |

→ Automaton probabilistic | ||

→ Frequency automaton | ||

→ HMMT | ||

→ Merge & Fold | ||

→ Forbidden words | ||

→ ALERGIA | ||

REFERENCES | ||

: Cormen, T and Leiserson, CIntroduction to Algorithms | ||

: Steven S. SkienaThe Algorithm Design Manual | ||

: C. de la HigueraGrammatical Inference: Learning Automata and Grammars |