Markov Model (Chain, Discrete Time, Continuous Time, Hidden)

From
Jump to: navigation, search

YouTube search... ...Google search

Wikipedia says, "A hidden Markov model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process with unobserved (hidden) states." What does that even mean? Introducing Hidden Markov Models (HMM) | Linear Digressions

Predecessor to Boltzmann machines (BM) and Hopfield network (HN). They can be understood as follows: from this node where I am now, what are the odds of me going to any of my neighbouring nodes? They are memoryless (i.e. Markov Property) which means that every state you end up in depends completely on the previous state. While not really a neural network, they do resemble neural networks and form the theoretical basis for BMs and HNs. MC aren’t always considered neural networks, as goes for BMs, RBMs and HNs. Markov chains aren’t always fully connected either. Hayes, Brian. “First links in the Markov chain.” American Scientist 101.2 (2013): 252.

mc.png

Markov Chain (MC)

YouTube search... ...Google search

Discrete Time Markov Chain (DTMC)

YouTube search... ...Google search


Continuous Time Markov Chain (CTMC)

YouTube search... ...Google search


Hidden Markov Model (HMM)

YouTube search... ...Google search

Viterbi Algorithm

YouTube search... ...Google search