Wikipedia:Reference desk/Archives/Mathematics/2018 November 24
| Mathematics desk | ||
|---|---|---|
| < November 23 | << Oct | November | Dec >> | Current desk > |
| Welcome to the Wikipedia Mathematics Reference Desk Archives |
|---|
| The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
November 24
editReplacing Viterbi algorithm with a graph algorithm
editViterbi algorithm is used to find the most likely sequence under HMM model. If we unfold the state transition over time, we obtain latent states graph (trellis). Is the problem Viterbi solves equivalent to finding the longest (heaviest) path in this graph? — Preceding unsigned comment added by 87.70.103.141 (talk) 20:28, 24 November 2018 (UTC)
- Courtesy links: HMM, Viterbi algorithm. I found an article [1] which may be useful. --RDBury (talk) 11:05, 25 November 2018 (UTC)