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
Credited To
Source Viterbi Algorithm (Wikipedia)
In Field
Source Viterbi Algorithm (Wikipedia)
Invented By
Andrew Viterbi published his dynamic programming algorithm for decoding convolutional codes in 1967.
Source Wikipedia: Andrew Viterbi
Uses Design Technique
Sources
1. Viterbi Algorithm (Wikipedia)
Wikipedia infobox: time complexity quadratic
quadratic
Lead section
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.
Credited To: Andrew Viterbi, History section
The Viterbi algorithm is named after Andrew Viterbi, who proposed it in 1967
In Field: Algorithms and Complexity Theory, Lead sentence
Viterbi algorithm is a dynamic programming algorithm that finds the most likely sequence of hidden events that would explain a sequence of observed events.
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.