{"id":6765,"date":"2018-12-18T14:40:31","date_gmt":"2018-12-18T13:40:31","guid":{"rendered":"http:\/\/smart--grid.net\/?page_id=6765"},"modified":"2022-12-03T23:02:04","modified_gmt":"2022-12-03T22:02:04","slug":"parcours-recherche-automate-stochastique-2018-2019","status":"publish","type":"page","link":"https:\/\/complex-systems-ai.com\/en\/markov-process\/stochastic-automaton-research-path-2018-2019\/","title":{"rendered":"Research Path: Stochastic Automaton (2018-2019)"},"content":{"rendered":"\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\ud83d\udd17 Project<\/a><\/td>\n<\/td>\n<\/td>\n<\/tr>\n
<\/td>\n<\/tr>\n
<\/td>\n<\/tr>\n
Session<\/strong><\/span><\/td>\nReading<\/strong><\/span><\/td>\nIdea \/ Concept<\/strong><\/span><\/td>\n<\/tr>\n
1<\/td>\n\ud83d\udd17 Reading 1<\/a><\/td>\nBasics<\/em><\/span><\/strong><\/td>\n<\/tr>\n
     \u2192 Probability<\/em><\/td>\n<\/tr>\n
     \u2192 Random variable<\/em><\/td>\n<\/tr>\n
     \u2192 Markov chain<\/a> discrete time order 1<\/em><\/td>\n<\/tr>\n
     \u2192 Theorem ergodic<\/a><\/em><\/td>\n<\/tr>\n
     \u2192 Absorption<\/em><\/td>\n<\/tr>\n
     \u2192 Study of a chain<\/em><\/td>\n<\/tr>\n
2<\/td>\n\ud83d\udd17 Reading 2<\/a><\/td>\nHidden Markov Chain<\/em><\/strong><\/td>\n<\/tr>\n
     \u2192 Definitions<\/em><\/td>\n<\/tr>\n
     \u2192 Backward-Forward<\/em><\/td>\n<\/tr>\n
     \u2192 Viterbi<\/em><\/td>\n<\/tr>\n
     \u2192 Baum-Welch<\/em><\/td>\n<\/tr>\n
     \u2192 sklearn<\/em><\/td>\n<\/tr>\n
3<\/td>\n\ud83d\udd17 Reading 3<\/a><\/td>\nProbabilistic automaton<\/em><\/strong><\/td>\n<\/tr>\n
     \u2192 Automaton<\/a> probabilistic<\/em><\/td>\n<\/tr>\n
     \u2192 Frequency automaton<\/em><\/td>\n<\/tr>\n
     \u2192 HMMT<\/em><\/td>\n<\/tr>\n
     \u2192 Merge & Fold<\/em><\/td>\n<\/tr>\n
     \u2192 Forbidden words<\/em><\/td>\n<\/tr>\n
     \u2192 ALERGIA<\/em><\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
<\/td>\n<\/tr>\n
                     REFERENCES<\/strong><\/span><\/td>\n<\/tr>\n
Introduction to Algorithms<\/em><\/strong>: Cormen, T and Leiserson, C<\/td>\n<\/tr>\n
The Algorithm Design Manual<\/em><\/strong>: Steven S. Skiena<\/td>\n<\/tr>\n
Grammatical Inference: Learning Automata and Grammars<\/em><\/strong>: C. de la Higuera<\/td>\n<\/tr>\n<\/tbody>\n<\/table>","protected":false},"excerpt":{"rendered":"

\ud83d\udd17 Project Session Lecture Idea\/Concept 1 \ud83d\udd17 Lecture 1 Basics \u2192 Probability \u2192 Random variable \u2192 Markov chain discrete time order \u2026 <\/p>","protected":false},"author":1,"featured_media":0,"parent":5007,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-6765","page","type-page","status-publish","hentry"],"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/pages\/6765","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/comments?post=6765"}],"version-history":[{"count":5,"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/pages\/6765\/revisions"}],"predecessor-version":[{"id":18695,"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/pages\/6765\/revisions\/18695"}],"up":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/pages\/5007"}],"wp:attachment":[{"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/media?parent=6765"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}