Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Viterbi Algorithm
CHF 48.70
Auf Lager
SKU
N9TJ3VV9801
1 Verfügbar 
Geliefert zwischen Mo., 16.02.2026 und Di., 17.02.2026
Details
High Quality Content by WIKIPEDIA articles! The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states ? called the Viterbi path ? that results in a sequence of observed events, especially in the context of Markov information sources, and more generally, hidden Markov models. The forward algorithm is a closely related algorithm for computing the probability of a sequence of observed events. These algorithms belong to the realm of information theory. The algorithm makes a number of assumptions. First, both the observed events and hidden events must be in a sequence. This sequence often corresponds to time. Second, these two sequences need to be aligned, and an instance of an observed event needs to correspond to exactly one instance of a hidden event. Third, computing the most likely hidden sequence up to a certain point t must depend only on the observed event at point t, and the most likely sequence at point t ? 1. These assumptions are all satisfied in a first-order hidden Markov model.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130355128
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B150mm x T7mm
- Jahr 2010
- EAN 9786130355128
- Format Fachbuch
- ISBN 978-613-0-35512-8
- Titel Viterbi Algorithm
- Untertitel Dynamic Programming, Algorithm, Likelihood Function, Markov Information Source, Hidden Markov Model, Information Theory, Error Detection and Correction
- Gewicht 203g
- Herausgeber VDM Verlag Dr. Müller e.K.
- Anzahl Seiten 124
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
