Cross Validated is a question and answer site for people interested in statistics, machine learning, data analysis, data mining, and data visualization. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am looking for example based explanation for HMM's. How is that the HMM has P(O|HMM model) will have 2T* N^T (T is the length of observation, N is number of hidden states.) And how this is solved by forward and backward algorithm. I need some example. - Thanks in Advance

share|improve this question
How is what solved ? $2T*n^T$ what? – Peter Flom Oct 2 '12 at 21:20
The question is asking about the forward backward algorithm which is used to do MAP inference in hidden markov models, and how it can explore the exponential in T number of possibilities efficiently. – rrenaud Oct 2 '12 at 21:40

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.