K-State CIS 798 - Multimodal Information Access and Synthesis (12 pages)

Previewing pages 1, 2, 3, 4 of 12 page document View the full content.
View Full Document

Multimodal Information Access and Synthesis



Previewing pages 1, 2, 3, 4 of actual document.

View the full content.
View Full Document
View Full Document

Multimodal Information Access and Synthesis

21 views


Pages:
12
School:
Kansas State University
Course:
Cis 798 - Top/Computer Science - Top/Cyber Defense Basics

Unformatted text preview:

Data Sciences Summer Institute Multimodal Information Access and Synthesis Learning and Reasoning with Graphical Models of Probability for the Identity Uncertainty Problem William H Hsu Tuesday 29 May 2007 Laboratory for Knowledge Discovery in Databases Kansas State University http www kddresearch org KSU CIS DSSI MIAS SRL 20070529 ppt DSSI MIAS University of Illinois at Urbana Champaign Computing Information Sciences Kansas State University Part 1 of 8 Graphical Models Intro Overview Graphical Models of Probability Markov graphs Bayesian belief networks Causal semantics Direction dependent separation d separation property Learning and Reasoning Problems Algorithms Inference exact and approximate Junction tree Lauritzen and Spiegelhalter 1988 Bounded loop cutset conditioning Horvitz and Cooper 1989 Variable elimination Dechter 1996 Structure learning K2 algorithm Cooper and Herskovits 1992 Variable ordering problem Larannaga 1996 Hsu et al 2002 Probabilistic Reasoning in Machine Learning Data Mining Current Research and Open Problems Computing Information Sciences Kansas State University Stages of Data Mining Adapted from Fayyad Piatetsky Shapiro and Smyth 1996 Computing Information Sciences Kansas State University Graphical Models Defined 1 Independence and Bayes Nets Conditional Independence X is conditionally independent CI from Y given Z sometimes written X Y Z iff P X Y Z P X Z for all values of X Y and Z Example P Thunder Rain Lightning P Thunder Lightning T R L Bayesian Belief Network Acyclic directed graph model B V E representing CI assertions over Vertices nodes V denote events each a random variable Edges arcs links E denote conditional dependencies Markov Condition for BBNs Chain Rule Example BBN Age X1 Exposure To Toxins X3 n P X 1 X 2 X n P X i parents X i i 1 Serum Calcium Cancer X6 X5 Gender X2 X4 Smoking X7 Lung Tumor Descendants Non Descendants Parents P 20s Female Low Non Smoker No Cancer Negative Negative P T P F P L T P N T F P N L N P N N P N N



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Multimodal Information Access and Synthesis and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Multimodal Information Access and Synthesis and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?