EdusalsaDiscover Your Stanford

CS 228

Probabilistic Graphical Models: Principles and Techniques

  • Not Offered

3 - 4 units

Letter or Credit/No Credit

Probabilistic graphical modeling languages for representing complex domains, algorithms for reasoning using these representations, and learning these representations from data. Topics include: Bayesian and Markov networks, extensions to temporal modeling such as hidden Markov models and dynamic Bayesian networks, exact and approximate probabilistic inference algorithms, and methods for learning models from data. Also included are sample applications to various domains including speech recognition, biological modeling and discovery, medical diagnosis, message encoding, vision, and robot motion planning. Prerequisites: basic probability theory and algorithm design and analysis.

CS 228 is useful for

Grade Distribution

Sign Up

To save CS 228 to your course bucketlist

Already Have An Account? Log In