1
$\begingroup$

I wonder what is the theoretical computational complexity of MHMM. Is it related to the number of alphabets in sequence mining?

Improve this question
$\endgroup$

1 Answer 1

Reset to default
1
$\begingroup$

Mixture hidden markov model is not one algorithm. It's made of forward algo, viterbi algo and forward-backward algo.

The time complexity of computing the forward variable used in hidden markov models is O(N2T) In which N is the number of states and T is the length of the observations sequence.

Improve this answer
$\endgroup$

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.