Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Forward algorithm
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Further reading == * Russell and Norvig's ''Artificial Intelligence, a Modern Approach'', starting on page 570 of the 2010 edition, provides a succinct exposition of this and related topics * Smyth, Padhraic, David Heckerman, and Michael I. Jordan. "Probabilistic independence networks for hidden Markov probability models." Neural computation 9.2 (1997): 227-269. [http://www.datalab.uci.edu/papers/hmmpin.pdf] * Read, Jonathon. "Hidden Markov Models and Dynamic Programming." University of Oslo (2011). [http://www.uio.no/studier/emner/matnat/ifi/INF4820/h11/undervisningsmateriale/20111014-notes.pdf] * Kohlschein, Christian, '' An introduction to Hidden Markov Models ''[http://www.tcs.rwth-aachen.de/lehre/PRICS/WS2006/kohlschein.pdf] * Manganiello, Fabio, Mirco Marchetti, and Michele Colajanni. ''Multistep attack detection and alert correlation in intrusion detection systems.'' Information Security and Assurance. Springer Berlin Heidelberg, 2011. 101-110. [https://weblab.ing.unimore.it/papers/isa2011.pdf] * Zhang, Ping, and Christos G. Cassandras. "An improved forward algorithm for optimal control of a class of hybrid systems." Automatic Control, IEEE Transactions on 47.10 (2002): 1735-1739. * Stratonovich, R. L. "Conditional markov processes". ''Theory of Probability & Its Applications'' 5, no. 2 (1960): 156178.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)