Review: Bayesian inference  A general scenario:  Query variables: X  Evidence (observed) variables and their values: E = e  Unobserved variables: Y.

Slides:



Advertisements
Similar presentations
Bayesian networks Chapter 14 Section 1 – 2. Outline Syntax Semantics Exact computation.
Advertisements

Probabilistic Reasoning Bayesian Belief Networks Constructing Bayesian Networks Representing Conditional Distributions Summary.
BAYESIAN NETWORKS. Bayesian Network Motivation  We want a representation and reasoning system that is based on conditional independence  Compact yet.
1 Knowledge Engineering for Bayesian Networks. 2 Probability theory for representing uncertainty l Assigns a numerical degree of belief between 0 and.
Identifying Conditional Independencies in Bayes Nets Lecture 4.
1 22c:145 Artificial Intelligence Bayesian Networks Reading: Ch 14. Russell & Norvig.
Bayesian Networks Chapter 14 Section 1, 2, 4. Bayesian networks A simple, graphical notation for conditional independence assertions and hence for compact.
CPSC 322, Lecture 26Slide 1 Reasoning Under Uncertainty: Belief Networks Computer Science cpsc322, Lecture 27 (Textbook Chpt 6.3) March, 16, 2009.
Review: Bayesian learning and inference
Bayesian Networks. Motivation The conditional independence assumption made by naïve Bayes classifiers may seem to rigid, especially for classification.
Probabilistic Reasoning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 14 (14.1, 14.2, 14.3, 14.4) Capturing uncertain knowledge Probabilistic.
1 Data Mining with Bayesian Networks (I) Instructor: Qiang Yang Hong Kong University of Science and Technology Thanks: Dan Weld, Eibe.
Bayesian networks Chapter 14 Section 1 – 2.
Bayesian Belief Networks
Bayesian Belief Network. The decomposition of large probabilistic domains into weakly connected subsets via conditional independence is one of the most.
5/25/2005EE562 EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 16, 6/1/2005 University of Washington, Department of Electrical Engineering Spring 2005.
Bayesian networks practice. Semantics e.g., P(j  m  a   b   e) = P(j | a) P(m | a) P(a |  b,  e) P(  b) P(  e) = … Suppose we have the variables.
Bayesian Reasoning. Tax Data – Naive Bayes Classify: (_, No, Married, 95K, ?)
Bayesian networks More commonly called graphical models A way to depict conditional independence relationships between random variables A compact specification.
Probabilistic Reasoning
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
Advanced Artificial Intelligence
Bayesian Networks Material used 1 Random variables
Artificial Intelligence CS 165A Tuesday, November 27, 2007  Probabilistic Reasoning (Ch 14)
Read R&N Ch Next lecture: Read R&N
Bayesian networks Chapter 14. Outline Syntax Semantics.
Bayesian Networks Tamara Berg CS Artificial Intelligence Many slides throughout the course adapted from Svetlana Lazebnik, Dan Klein, Stuart Russell,
Bayesian networks Chapter 14 Section 1 – 2. Bayesian networks A simple, graphical notation for conditional independence assertions and hence for compact.
An Introduction to Artificial Intelligence Chapter 13 & : Uncertainty & Bayesian Networks Ramin Halavati
Probabilistic Belief States and Bayesian Networks (Where we exploit the sparseness of direct interactions among components of a world) R&N: Chap. 14, Sect.
Bayesian networks. Motivation We saw that the full joint probability can be used to answer any question about the domain, but can become intractable as.
1 Chapter 14 Probabilistic Reasoning. 2 Outline Syntax of Bayesian networks Semantics of Bayesian networks Efficient representation of conditional distributions.
2 Syntax of Bayesian networks Semantics of Bayesian networks Efficient representation of conditional distributions Exact inference by enumeration Exact.
1 Monte Carlo Artificial Intelligence: Bayesian Networks.
An Introduction to Artificial Intelligence Chapter 13 & : Uncertainty & Bayesian Networks Ramin Halavati
Suppose we choose the ordering M, J, A, B, E P(J | M) = P(J)? Example.
Probabilistic Reasoning [Ch. 14] Bayes Networks – Part 1 ◦Syntax ◦Semantics ◦Parameterized distributions Inference – Part2 ◦Exact inference by enumeration.
Marginalization & Conditioning Marginalization (summing out): for any sets of variables Y and Z: Conditioning(variant of marginalization):
CHAPTER 5 Probability Theory (continued) Introduction to Bayesian Networks.
Bayesian Networks CSE 473. © D. Weld and D. Fox 2 Bayes Nets In general, joint distribution P over set of variables (X 1 x... x X n ) requires exponential.
CPSC 7373: Artificial Intelligence Lecture 5: Probabilistic Inference Jiang Bian, Fall 2012 University of Arkansas at Little Rock.
1 Probability FOL fails for a domain due to: –Laziness: too much to list the complete set of rules, too hard to use the enormous rules that result –Theoretical.
Belief Networks Kostas Kontogiannis E&CE 457. Belief Networks A belief network is a graph in which the following holds: –A set of random variables makes.
CPSC 322, Lecture 26Slide 1 Reasoning Under Uncertainty: Belief Networks Computer Science cpsc322, Lecture 27 (Textbook Chpt 6.3) Nov, 13, 2013.
Bayesian networks Chapter 14 Slide Set 2. Constructing Bayesian networks 1. Choose an ordering of variables X 1, …,X n 2. For i = 1 to n –add X i to the.
Conditional Independence As with absolute independence, the equivalent forms of X and Y being conditionally independent given Z can also be used: P(X|Y,
PROBABILISTIC REASONING Heng Ji 04/05, 04/08, 2016.
Chapter 12. Probability Reasoning Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
CS 2750: Machine Learning Bayesian Networks Prof. Adriana Kovashka University of Pittsburgh March 14, 2016.
Web-Mining Agents Data Mining Prof. Dr. Ralf Möller Universität zu Lübeck Institut für Informationssysteme Karsten Martiny (Übungen)
A Brief Introduction to Bayesian networks
Another look at Bayesian inference
Reasoning Under Uncertainty: Belief Networks
CS 2750: Machine Learning Directed Graphical Models
Bayesian Networks Chapter 14 Section 1, 2, 4.
Bayesian networks Chapter 14 Section 1 – 2.
Presented By S.Yamuna AP/CSE
Qian Liu CSE spring University of Pennsylvania
Bayesian networks (1) Lirong Xia Spring Bayesian networks (1) Lirong Xia Spring 2017.
Bayesian Networks Probability In AI.
Read R&N Ch Next lecture: Read R&N
Probabilistic Reasoning; Network-based reasoning
Structure and Semantics of BN
CS 188: Artificial Intelligence Fall 2007
Structure and Semantics of BN
Bayesian networks Chapter 14 Section 1 – 2.
Probabilistic Reasoning
Chapter 14 February 26, 2004.
Bayesian networks (1) Lirong Xia. Bayesian networks (1) Lirong Xia.
Presentation transcript:

Review: Bayesian inference  A general scenario:  Query variables: X  Evidence (observed) variables and their values: E = e  Unobserved variables: Y  Inference problem: answer questions about the query variables given the evidence variables  This can be done using the posterior distribution P(X | E = e)  In turn, the posterior needs to be derived from the full joint P(X, E, Y)  Bayesian networks are a tool for representing joint probability distributions efficiently

Bayesian networks More commonly called graphical models A way to depict conditional independence relationships between random variables A compact specification of full joint distributions

Structure Nodes: random variables Arcs: interactions –An arrow from one variable to another indicates direct influence –Must form a directed, acyclic graph

Example: N independent coin flips Complete independence: no interactions X1X1 X2X2 XnXn …

Example: Naïve Bayes document model Random variables: –X: document class –W 1, …, W n : words in the document W1W1 W2W2 WnWn … X

Example: Burglar Alarm I have a burglar alarm that is sometimes set off by minor earthquakes. My two neighbors, John and Mary, promised to call me at work if they hear the alarm –Example inference task: suppose Mary calls and John doesn’t call. What is the probability of a burglary? What are the random variables? –Burglary, Earthquake, Alarm, JohnCalls, MaryCalls What are the direct influence relationships? –A burglar can set the alarm off –An earthquake can set the alarm off –The alarm can cause Mary to call –The alarm can cause John to call

Example: Burglar Alarm Key property: every node is conditionally independent of its non-descendants given its parents

Conditional independence and the joint distribution Key property: each node is conditionally independent of its non-descendants given its parents Suppose the nodes X 1, …, X n are sorted in topological order To get the joint distribution P(X 1, …, X n ), use chain rule:

Conditional probability distributions To specify the full joint distribution, we need to specify a conditional distribution for each node given its parents: P (X | Parents(X)) Z1Z1 Z2Z2 ZnZn X … P (X | Z 1, …, Z n )

Example: Burglar Alarm The conditional probability tables are the model parameters

The joint probability distribution For example, P(j, m, a,  b,  e) = P(  b) P(  e) P(a |  b,  e) P(j | a) P(m | a)

Conditional independence Key property: X is conditionally independent of every non-descendant node given its parents Example: causal chain Are X and Z independent? Is Z independent of X given Y?

Conditional independence Common cause Are X and Z independent? –No Are they conditionally independent given Y? –Yes Common effect Are X and Z independent? –Yes Are they conditionally independent given Y? –No

Compactness Suppose we have a Boolean variable X i with k Boolean parents. How many rows does its conditional probability table have? –2 k rows for all the combinations of parent values –Each row requires one number p for X i = true If each variable has no more than k parents, how many numbers does the complete network require? –O(n · 2 k ) numbers – vs. O(2 n ) for the full joint distribution How many nodes for the burglary network? = 10 numbers (vs = 31)

Constructing Bayesian networks 1.Choose an ordering of variables X 1, …, X n 2.For i = 1 to n –add X i to the network –select parents from X 1, …,X i-1 such that P(X i | Parents(X i )) = P(X i | X 1,... X i-1 )

Suppose we choose the ordering M, J, A, B, E Example

Suppose we choose the ordering M, J, A, B, E Example

Suppose we choose the ordering M, J, A, B, E Example

Suppose we choose the ordering M, J, A, B, E Example

Suppose we choose the ordering M, J, A, B, E Example

Suppose we choose the ordering M, J, A, B, E Example

Suppose we choose the ordering M, J, A, B, E Example

Suppose we choose the ordering M, J, A, B, E Example

Example contd. Deciding conditional independence is hard in noncausal directions –The causal direction seems much more natural Network is less compact: = 13 numbers needed

A more realistic Bayes Network: Car diagnosis Initial observation: car won’t start Orange: “broken, so fix it” nodes Green: testable evidence Gray: “hidden variables” to ensure sparse structure, reduce parameteres

Car insurance

In research literature… Causal Protein-Signaling Networks Derived from Multiparameter Single-Cell Data Karen Sachs, Omar Perez, Dana Pe'er, Douglas A. Lauffenburger, and Garry P. Nolan (22 April 2005) Science 308 (5721), 523.

In research literature… Describing Visual Scenes Using Transformed Objects and Parts E. Sudderth, A. Torralba, W. T. Freeman, and A. Willsky. International Journal of Computer Vision, No. 1-3, May 2008, pp

Summary Bayesian networks provide a natural representation for (causally induced) conditional independence Topology + conditional probability tables Generally easy for domain experts to construct