- This topic has 1 reply, 2 voices, and was last updated 3 years, 7 months ago by .
Viewing 1 reply thread
Viewing 1 reply thread
- You must be logged in to reply to this topic.
› Forums › Speech Synthesis › The front end › greedy algorithm
Are the Viterbi algorithm and a greedy algorithm different?
It seems Viterbi algorithms differs from a greedy algorithm in that it finds the best path in HMM, but both algorithms are basically to solve optimisation problems?
The Viterbi algorithm is not a greedy algorithm. It performs a global optimisation and guarantees to find the most likely state sequence, by exploring all possible state sequences.
An example of a greedy algorithm is the one for training a CART. Unlike the Viterbi algorithm, this algorithm does not explore all possibilities: it takes a sequence of local, hard decisions (about the best question to split the data) and does not backtrack. It does not guarantee to find the globally-optimal tree.
Some forums are only available if you are logged in. Searching will only return results from those forums if you log in.
Copyright © 2024 · Balance Child Theme on Genesis Framework · WordPress · Log in