Content deleted Content added
Undid revision 1174420215 by Zied130 (talk) arXiv preprints are not reliable, possible coi |
|||
Line 1:
{{short description|Finds likely sequence of hidden states}}
{{Multiple issues|
{{Technical|date=September 2023}}
{{Tone|date=September 2023}}
}}
The '''Viterbi algorithm''' is a [[dynamic programming]] [[algorithm]] for obtaining the [[Maximum a posteriori estimation|maximum a posteriori probability estimate]] of the most [[likelihood function|likely]] sequence of hidden states—called the '''Viterbi path'''—that results in a sequence of observed events, especially in the context of [[Markov information source]]s and [[hidden Markov model]]s (HMM).
| |||