Can any one clear me the concept of hidden markov model?

  • Thread starter Thread starter dexterdev
  • Start date Start date
  • Tags Tags
    Concept Model
dexterdev
Messages
194
Reaction score
1
Hi friends,
I have an idea what a markov chain is. But when it comes to HMM (hidden markov model) I have a doubt regarding emission matrix. What is emission matrix? I have an idea of transition matrix , current states etc. when coming to simulation (using Matlab) I don't have a choice of ordinary markov chains, only HMM is available. why is it so?

I would like to learn markov chains because of its applications in prediction and music etc.

-Devanand T
 
Physics news on Phys.org
The emission matrix is one of the parameter for a hidden markov. Basically, you have the transition matrix with N possible states that at time t, the hidden variable can take. The transition from t to t + 1 the variable can take on N possible choices for each state, thus there exist N^2 'transition possibilities'. The key rule for the transition matrix is that for each transition, the transitions probability must sum to 1 and this must hold for every transition. What we end up with is a N X N stochastic matrix with a total of N(N-1) transition parameter.

The emission matrix is collection of emission probabilities. Each state is given an emission probability, where each state has a possible emission probability. This is a bit more tricky to handle. The set is determined by the size of the observable data, you typically have to relate them to a distribution. The common ways would be the categorical distribution and Gaussian distribution.

All this becomes more clear with an example. The most common one would be weather forecast. If no one else comes to clear up my muddy explanation, I'll post a concrete example.

As for why matlab, I imagine the reason why they format it as a HMM is because in one way you can view a typical markov chain is an hidden markov model without the uncertainty of the output.
 
  • Like
Likes dexterdev
Thank you for the reply , I will wait for the example... :)
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top