| http://dbpedia.org/ontology/abstract
|
前向算法（Forward algorithm），在隐马尔可夫模型（HMM）中，是用于计算“置信状态”的。置信状态指根据既往证据推算出的当前状态的概率分布。这个过程也被叫做“滤波”。前向算法和维特比算法紧密相关但又互不相同。
, Der Forward-Algorithmus (auch Vorwärts-Alg … Der Forward-Algorithmus (auch Vorwärts-Algorithmus, Vorwärts-Prozedur) berechnet mit Hilfe sogenannter Forward-Variablen für ein gegebenes Hidden-Markov-Modell die Wahrscheinlichkeit einer bestimmten Beobachtung.Er verwendet die Programmiermethode der dynamischen Programmierung.iermethode der dynamischen Programmierung.
, The forward algorithm, in the context of a … The forward algorithm, in the context of a hidden Markov model (HMM), is used to calculate a 'belief state': the probability of a state at a certain time, given the history of evidence. The process is also known as filtering. The forward algorithm is closely related to, but distinct from, the Viterbi algorithm. The forward and backward algorithms should be placed within the context of probability as they appear to simply be names given to a set of standard mathematical procedures within a few fields. For example, neither "forward algorithm" nor "Viterbi" appear in the Cambridge encyclopedia of mathematics. The main observation to take away from these algorithms is how to organize Bayesian updates and inference to be efficient in the context of directed graphs of variables (see sum-product networks). For an HMM such as this one: this probability is written as . Here is the hidden state which is abbreviated as and are the observations to . The backward algorithm complements the forward algorithm by taking into account the future history if one wanted to improve the estimate for past times. This is referred to as smoothing and the forward/backward algorithm computes for . Thus, the full forward/backward algorithm takes into account all evidence. Note that a belief state can be calculated at each time step, but doing this does not, in a strict sense, produce the most likely state sequence, but rather the most likely state at each time step, given the previous history. In order to achieve the most likely sequence, the Viterbi algorithm is required. It computes the most likely state sequence given the history of observations, that is, the state sequence that maximizes .at is, the state sequence that maximizes .
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Hmm_temporal_bayesian_net.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.ghmm.org/ +
, https://cran.r-project.org/web/packages/HMM/index.html +
, http://www.tcs.rwth-aachen.de/lehre/PRICS/WS2006/kohlschein.pdf +
, https://github.com/pushkar/ABAGAIL +
, http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hmm +
, https://weblab.ing.unimore.it/papers/isa2011.pdf +
, http://www.datalab.uci.edu/papers/hmmpin.pdf +
, http://www.uio.no/studier/emner/matnat/ifi/INF4820/h11/undervisningsmateriale/20111014-notes.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
1072943
|
| http://dbpedia.org/ontology/wikiPageLength
|
14994
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1104111459
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Forward-backward_algorithm +
, http://dbpedia.org/resource/Joint_probability_distribution +
, http://dbpedia.org/resource/Baum%E2%80%93Welch_algorithm +
, http://dbpedia.org/resource/File:Hmm_temporal_bayesian_net.svg +
, http://dbpedia.org/resource/Viterbi_algorithm +
, http://dbpedia.org/resource/Forward/backward_algorithm +
, http://dbpedia.org/resource/Linear%E2%80%93quadratic_regulator +
, http://dbpedia.org/resource/Computational_biology +
, http://dbpedia.org/resource/Chain_rule_%28probability%29 +
, http://dbpedia.org/resource/Belief_propagation +
, http://dbpedia.org/resource/Conditional_independence +
, http://dbpedia.org/resource/Marginal_distribution +
, http://dbpedia.org/resource/Category:Markov_models +
, http://dbpedia.org/resource/Hidden_Markov_model +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Framebox +
, http://dbpedia.org/resource/Template:Frame-footer +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Distinguish +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Markov_models +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Forward_algorithm?oldid=1104111459&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Hmm_temporal_bayesian_net.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Forward_algorithm +
|
| owl:differentFrom |
http://dbpedia.org/resource/Forward-backward_algorithm +
|
| owl:sameAs |
http://fa.dbpedia.org/resource/%D8%A7%D9%84%DA%AF%D9%88%D8%B1%DB%8C%D8%AA%D9%85_%D8%AC%D9%84%D9%88%D8%B1%D9%88%D9%86%D8%AF%D9%87 +
, http://www.wikidata.org/entity/Q5473264 +
, http://dbpedia.org/resource/Forward_algorithm +
, http://rdf.freebase.com/ns/m.0bs98w5 +
, http://de.dbpedia.org/resource/Forward-Algorithmus +
, http://yago-knowledge.org/resource/Forward_algorithm +
, https://global.dbpedia.org/id/4jLbp +
, http://zh.dbpedia.org/resource/%E5%89%8D%E5%90%91%E7%AE%97%E6%B3%95 +
|
| rdf:type |
http://dbpedia.org/class/yago/Object100002684 +
, http://dbpedia.org/class/yago/CausalAgent100007347 +
, http://dbpedia.org/class/yago/Model110324560 +
, http://dbpedia.org/class/yago/Assistant109815790 +
, http://dbpedia.org/class/yago/WikicatMarkovModels +
, http://dbpedia.org/class/yago/LivingThing100004258 +
, http://dbpedia.org/class/yago/Worker109632518 +
, http://dbpedia.org/class/yago/Organism100004475 +
, http://dbpedia.org/class/yago/YagoLegalActorGeo +
, http://dbpedia.org/class/yago/YagoLegalActor +
, http://dbpedia.org/class/yago/PhysicalEntity100001930 +
, http://dbpedia.org/class/yago/Whole100003553 +
, http://dbpedia.org/class/yago/Person100007846 +
|
| rdfs:comment |
前向算法（Forward algorithm），在隐马尔可夫模型（HMM）中，是用于计算“置信状态”的。置信状态指根据既往证据推算出的当前状态的概率分布。这个过程也被叫做“滤波”。前向算法和维特比算法紧密相关但又互不相同。
, The forward algorithm, in the context of a … The forward algorithm, in the context of a hidden Markov model (HMM), is used to calculate a 'belief state': the probability of a state at a certain time, given the history of evidence. The process is also known as filtering. The forward algorithm is closely related to, but distinct from, the Viterbi algorithm. For an HMM such as this one: this probability is written as . Here is the hidden state which is abbreviated as and are the observations to .breviated as and are the observations to .
, Der Forward-Algorithmus (auch Vorwärts-Alg … Der Forward-Algorithmus (auch Vorwärts-Algorithmus, Vorwärts-Prozedur) berechnet mit Hilfe sogenannter Forward-Variablen für ein gegebenes Hidden-Markov-Modell die Wahrscheinlichkeit einer bestimmten Beobachtung.Er verwendet die Programmiermethode der dynamischen Programmierung.iermethode der dynamischen Programmierung.
|
| rdfs:label |
Forward algorithm
, 前向算法
, Forward-Algorithmus
|
