1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Hidden Markov Models

  1. Sep 30, 2013 #1
    1. The problem statement, all variables and given/known data
    Define a Hidden Markov Model with the following parameters: State space S={1,2,3}, alphabet A = {a,b,c,}, P = 0 .5 .5
    1 0 0
    0 1 0

    initial probability vector, ∏ = 1 0 0

    b1(a) = 1/2 ; b1(b) = 1/2 ; b1(c) = 0
    b2(a) = 1/2 ; b2(b) = 0; b2(c) = 1/2
    b3(a) = 0; b3(b) = 1/2 ; b3(c) = 1/2

    List all possible state sequences Q = (q1; q2; q3). Consider the observations
    O = (a; b; c). What is the probability to observe this sequence in the model, i.e.
    find P(O|λ)? Given these observations, which state sequence has most likely
    generated it, i.e., find P(Q|O)?

    2. Relevant equations

    Remember the collection of parameters of a Hidden Markov Model is denoted λ = (P, B, ∏)



    3. The attempt at a solution

    Since ∏ has a 1 in the first entry, we always start in state 1. Thus, the probabilities of starting in other states, (P(O=abc|Q=312)*P(312) for example = 0), so we only need to find P(O=abc|Q=123)*P(Q=123) + P(O=abc|Q=132)*P(132). Well, right off the bat, the probability of going from state 2 to observation b is 0 so P(O=abc|Q=123)*P(Q=123)=0 already. Therefore, the only thing left is P(O=abc|Q=132)*P(132)=.5^4=1/16, so the probability to observe the sequence (a,b,c) in this model is 1/16.

    Am I doing something wrong here?
     
  2. jcsd
  3. Sep 30, 2013 #2
    I just realized that the sequence could also be given by Q=111, 112, 113, 121, 122, and 133. It wasn't as easy as I originally thought.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: Hidden Markov Models
  1. Markov chains (Replies: 0)

  2. Markov process (Replies: 11)

  3. Markov process (Replies: 0)

  4. Markov Chain (Replies: 1)

Loading...