The Viterbi algorithm is a dynamic programming algorithm that finds the most likely sequence of hidden events, called the Viterbi path, that would explain a sequence of observed events. It is most commonly applied with hidden Markov models, for example to determine the most probable sequence of underlying health conditions that would explain a patient's observed symptoms over several days.
Facts
Time Complexity
Time Complexity (category)Quadratic Time -- O(n^2) 1 Classification
Design Technique Connections
Invented By
Andrew Viterbi published his dynamic programming algorithm for decoding convolutional codes in 1967.
Source Wikipedia: Andrew Viterbi
Sources
1. Viterbi Algorithm (Wikipedia)
Wikipedia infobox: time complexity quadratic
quadratic
Wikipedia: design technique dynamic-programming
dynamic-programming
View the SourceWikidata: Viterbi Algorithm
Viterbi Algorithm (Wikipedia)
https://en.wikipedia.org/wiki/Viterbi_algorithmQuote, https://en.wikipedia.org/wiki/Viterbi_algorithm
The Viterbi algorithm is a dynamic programming algorithm that finds the most likely sequence of hidden events that would explain a sequence of observed events.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.