1 / 8

SEG 4560 Final Review

SEG 4560 Final Review. Final. 4:15-6:15pm, Friday April 24, 2009 6 Questions from Chapters 3-15a Two A4 size cheat sheets A calculator Useful materials: Tutorials 1-3, Assignments 1-3, Midterm, and Lecture notes. Chapter 15a. Markov processes Sensor model Transition model

calvin-briggs
Download Presentation

SEG 4560 Final Review

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. SEG 4560 Final Review

  2. Final • 4:15-6:15pm, Friday April 24, 2009 • 6 Questions from Chapters 3-15a • Two A4 size cheat sheets • A calculator • Useful materials: Tutorials 1-3, Assignments 1-3, Midterm, and Lecture notes

  3. Chapter 15a • Markov processes • Sensor model • Transition model • Inference tasks • Filtering • Prediction • Smoothing • Most likely explanation

  4. Chapter 14 • Bayesian networks • Network topology and CPTs • Express a full joint distribution with BN • Inference tasks • Exact inference by enumeration • Exact inference by variable elimination • Approximate inference

  5. Chapter 13 • Bayes’ Rule • Transform to a full joint distribution (or probability with some hidden variables) • Sum over all hidden variables • Independence and conditional independence

  6. Chapters 7-9 • Express sentences in • Propositional logic • First-order logic • Unification • Entailment

  7. Chapter 5 • CSPs • Variables • Domains • Constraints • Backtracking search for CSPs • Various heuristics to speedup search

  8. Chapters 3-4 • Uninformed search • Breadth-first search • Uniform-cost search • Depth-first search • Depth-limited search • Iterative deepening search • Informed search • Greedy search and A* search • Local search • Hill-climbing • Properties of these search methods • Efficiency • Space • Completeness • Optimality

More Related