Timeline for HMCM vs Viterbi algorithm for calculating most likely path of an HMM [duplicate]
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 17, 2014 at 21:52 | history | closed |
Xi'an kjetil b halvorsen♦ gung - Reinstate Monica Nick Cox amoeba |
Duplicate of What is the difference between the forward-backward and Viterbi algorithms? | |
Dec 17, 2014 at 12:09 | review | Close votes | |||
Dec 17, 2014 at 21:52 | |||||
Dec 17, 2014 at 9:24 | answer | added | mzivi | timeline score: 1 | |
Dec 17, 2014 at 8:15 | comment | added | Glen_b | MCMC doesn't just find the most likely path. It can give a great deal of information about probabilities of any paths and any states. It could be used to find the most likely path, but (to take a simpler situation) that's like saying "the purpose of simulating from a distribution is to identify its mode". | |
Dec 17, 2014 at 7:07 | review | First posts | |||
Dec 17, 2014 at 8:05 | |||||
Dec 17, 2014 at 7:06 | history | asked | user1005909 | CC BY-SA 3.0 |