Data Mining 2018 Bayesian Networks (1)
|
|
- Jasmin Lane
- 5 years ago
- Views:
Transcription
1 Data Mining 2018 Bayesian Networks (1) Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Data Mining 1 / 49
2 Do you like noodles? Do you like noodles? Race Gender Yes No Black Male Female White Male Female Ad Feelders ( Universiteit Utrecht ) Data Mining 2 / 49
3 Do you like noodles? Undirected G R A G R A Strange: Gender and Race are prior to Answer, but this model says they are independent given Answer! Ad Feelders ( Universiteit Utrecht ) Data Mining 3 / 49
4 Do you like noodles? Marginal table for Gender and Race: Race Gender Black White Male Female From this table we conclude that Race and Gender are independent in the data. Ad Feelders ( Universiteit Utrecht ) Data Mining 4 / 49
5 Do you like noodles? Directed G R A G R, G R A Gender and Race are marginally independent (but dependent given Answer). Ad Feelders ( Universiteit Utrecht ) Data Mining 5 / 49
6 Do you like noodles? Table for Gender and Race given Answer=yes: Race Gender Black White Male Female Table for Gender and Race given Answer=no: Race Gender Black White Male Female From these tables we conclude that Race and Gender are dependent given Answer. Ad Feelders ( Universiteit Utrecht ) Data Mining 6 / 49
7 Directed Independence Graphs G = (K, E), K is a set of vertices and E is a set of edges with ordered pairs of vertices. No directed cycles (DAG) parent/child ancestor/descendant ancestral set Because G is a DAG, there exists a complete ordering of the vertices that is respected in the graph (edges point from lower ordered to higher ordered nodes). Ad Feelders ( Universiteit Utrecht ) Data Mining 7 / 49
8 Parents Of Node i: pa(i) i Ad Feelders ( Universiteit Utrecht ) Data Mining 8 / 49
9 Ancestors Of Node i: an(i) i Ad Feelders ( Universiteit Utrecht ) Data Mining 9 / 49
10 Ancestral Set Of Node i: an + (i) i Ad Feelders ( Universiteit Utrecht ) Data Mining 10 / 49
11 Children Of Node i: ch(i) i Ad Feelders ( Universiteit Utrecht ) Data Mining 11 / 49
12 Descendants Of Node i: de(i) i Ad Feelders ( Universiteit Utrecht ) Data Mining 12 / 49
13 Construction of DAG Suppose that prior knowledge tells us the variables can be labeled X 1, X 2,..., X k such that X i is prior to X i+1. (for example: causal or temporal ordering) Corresponding to this ordering we can use the product rule to factorize the joint distribution of X 1, X 2,..., X k as P(X ) = P(X 1 )P(X 2 X 1 ) P(X k X k 1, X k 2,..., X 1 ) This is an identity of probability theory, no independence assumptions have been made yet! Ad Feelders ( Universiteit Utrecht ) Data Mining 13 / 49
14 Constructing a DAG from pairwise independencies In constructing a DAG, an arrow is drawn from i to j, where i < j, unless P(X j X j 1,..., X 1 ) does not depend on X i, in other words, unless More loosely j i {1,..., j} \ {i, j} j i prior variables Compare this to pairwise independence in undirected independence graphs. j i rest Ad Feelders ( Universiteit Utrecht ) Data Mining 14 / 49
15 Construction Of DAG P(X ) = P(X 1 )P(X 2 X 1 )P(X 3 X 1, X 2 )P(X 4 X 1, X 2, X 3 ) Suppose the following independencies are given: 1 X 1 X 2 2 X 4 X 3 (X 1, X 2 ) 3 X 1 X 3 X 2 Ad Feelders ( Universiteit Utrecht ) Data Mining 15 / 49
16 Construction Of DAG P(X ) = P(X 1 ) P(X 2 X 1 ) P(X 3 X 1, X 2 )P(X 4 X 1, X 2, X 3 ) }{{} P(X 2 ) 1 If X 1 X 2, then P(X 2 X 1 ) = P(X 2 ). The edge 1 2 is removed. Ad Feelders ( Universiteit Utrecht ) Data Mining 16 / 49
17 Construction Of DAG P(X ) = P(X 1 )P(X 2 )P(X 3 X 1, X 2 )P(X 4 X 1, X 2, X 3 ) Ad Feelders ( Universiteit Utrecht ) Data Mining 17 / 49
18 Construction Of DAG P(X ) = P(X 1 )P(X 2 )P(X 3 X 1, X 2 ) P(X 4 X 1, X 2, X 3 ) }{{} P(X 4 X 1,X 2 ) 2 If X 4 X 3 (X 1, X 2 ), then P(X 4 X 1, X 2, X 3 ) = P(X 4 X 1, X 2 ). The edge 3 4 is removed. Ad Feelders ( Universiteit Utrecht ) Data Mining 18 / 49
19 Construction Of DAG P(X ) = P(X 1 )P(X 2 )P(X 3 X 1, X 2 )P(X 4 X 1, X 2 ) Ad Feelders ( Universiteit Utrecht ) Data Mining 19 / 49
20 Construction Of DAG P(X ) = P(X 1 )P(X 2 ) P(X 3 X 1, X 2 ) P(X 4 X 1, X 2 ) }{{} P(X 3 X 2 ) 3 If X 1 X 3 X 2, then P(X 3 X 1, X 2 ) = P(X 3 X 2 ) The edge 1 3 is removed. Ad Feelders ( Universiteit Utrecht ) Data Mining 20 / 49
21 Construction Of DAG P(X ) = P(X 1 )P(X 2 )P(X 3 X 2 )P(X 4 X 1, X 2 ) Ad Feelders ( Universiteit Utrecht ) Data Mining 21 / 49
22 Joint density of Bayesian Network We can write the joint density more elegantly as k P(X 1,..., X k ) = P(X i X pa(i) ) i=1 Ad Feelders ( Universiteit Utrecht ) Data Mining 22 / 49
23 Independence Properties of DAGs: d-separation and Moral Graphs Can we infer other/stronger independence statements from the directed graph like we did using separation in the undirected graphical models? Yes, the relevant concept is called d-separation. establishing d-separation directly (Pearl) establishing d-separation via the moral graph and normal separation We discuss each in turn. Ad Feelders ( Universiteit Utrecht ) Data Mining 23 / 49
24 Independence Properties of DAGs: d-separation A path p is blocked by a set of nodes Z if and only if: 1 p contains a chain of nodes A B C, or a fork A B C, such that the middle node B is in Z; or 2 p contains a collider A B C such that the collision node B is not in Z, and no descendant of B is in Z either. If Z blocks every path between two nodes X and Y, then X and Y are d-separated by Z, and thus X and Y are independent given Z. Ad Feelders ( Universiteit Utrecht ) Data Mining 24 / 49
25 Independence Properties of DAGs: Moral Graph Given a DAG G = (K, E) we construct the moral graph G m by marrying parents, and deleting directions, that is, 1 For each i K, we connect all vertices in pa(i) with undirected edges. 2 We replace all directed edges in E with undirected ones. Ad Feelders ( Universiteit Utrecht ) Data Mining 25 / 49
26 Independence Properties of DAGs: Moral Graph The directed independence graph G possesses the conditional independence properties of its associated moral graph G m. Why? We have the factorisation: P(X ) = = k P(X i X pa(i) ) i=1 k g i (X i, X pa(i) ) i=1 by setting g i (X i, X pa(i) ) = P(X i X pa(i) ). Ad Feelders ( Universiteit Utrecht ) Data Mining 26 / 49
27 Independence Properties of DAGs: Moral Graph We have the factorisation: k P(X ) = g i (X i, X pa(i) ) (1) i=1 We thus have a factorisation of the joint probability distribution in terms of functions g i (X ai ) where a i = {i} pa(i). By application of the factorisation criterion the sets a i become cliques in the undirected independence graph. Such cliques are formed by moralization. Ad Feelders ( Universiteit Utrecht ) Data Mining 27 / 49
28 Moralisation: Example X 1 X2 X 4 X 3 X 5 Ad Feelders ( Universiteit Utrecht ) Data Mining 28 / 49
29 Moralisation: Example X 1 X2 X 4 X 3 X 5 {i} pa(i) becomes a complete subgraph in the moral graph (by marrying all unmarried parents). Ad Feelders ( Universiteit Utrecht ) Data Mining 29 / 49
30 Moralisation Continued Warning: the complete moral graph can obscure independencies! To verify construct the moral graph on i j S that is i, j, S and all their ancestors. A = an + ({i, j} S), Ad Feelders ( Universiteit Utrecht ) Data Mining 30 / 49
31 Moralisation Continued Since for l A, pa(l) A, we know that the joint distribution of X A is given by P(X A ) = l A P(X l X pa(l) ) which corresponds to the subgraph G A of G. 1 This is a product of factors P(X l X pa(l) ), involving the variables X {l} pa(l) only. 2 So it factorizes according to GA m, and thus the independence properties for undirected graphs apply. 3 So, if S separates i from j in GA m, then i j S. Ad Feelders ( Universiteit Utrecht ) Data Mining 31 / 49
32 Full moral graph may obscure independencies: example G R A P(G, R, A) = P(G)P(R)P(A G, R) Does G R hold? Summing out A we obtain: P(G, R) = a = a P(G, R, A = a) P(G)P(R)P(A = a G, R) (sum rule) (BN factorisation) = P(G)P(R) a P(A = a G, R) (rule of summation) = P(G)P(R) ( a P(A = a G, R) = 1) Ad Feelders ( Universiteit Utrecht ) Data Mining 32 / 49
33 Moralisation Continued: example X 1 X2 X 4 X 3 X 5 Are X 3 and X 4 independent? Are X 1 and X 3 independent? Are X 3 and X 4 independent given X 5? Ad Feelders ( Universiteit Utrecht ) Data Mining 33 / 49
34 Equivalence When no marrying of parents is required (there are no immoralities or v-structures ), then the independence properties of the directed graph are identical to those of its undirected version. These three graphs express the same independence properties: Ad Feelders ( Universiteit Utrecht ) Data Mining 34 / 49
35 Learning Bayesian Networks 1 Parameter learning: structure known/given; we only need to estimate the conditional probabilities from the data. 2 Structure learning: structure unknown; we need to learn the networks structure as well as the corresponding conditional probabilities from the data. Ad Feelders ( Universiteit Utrecht ) Data Mining 35 / 49
36 Maximum Likelihood Estimation Find value of unknown parameter(s) that maximize the probability of the observed data. n independent observations on binary variable X {1, 2}. We observe n(1) outcomes X = 1 and n(2) = n n(1) outcomes X = 2. What is the maximum likelihood estimate of p(1)? The likelihood function (probability of the data) is given by: Taking the log we get L = p(1) n(1) (1 p(1)) n n(1) L = n(1) log p(1) + (n n(1)) log(1 p(1)) Ad Feelders ( Universiteit Utrecht ) Data Mining 36 / 49
37 Maximum Likelihood Estimation Take derivative with respect to p(1), equate to zero, and solve for p(1). dl dp(1) = n(1) p(1) n n(1) 1 p(1) = 0, since d log x dx = 1 x (where log is the natural logarithm). Solving for p(1), we get p(1) = n(1) n, i.e., the fraction of one s in the sample! Ad Feelders ( Universiteit Utrecht ) Data Mining 37 / 49
38 ML Estimation of Multinomial Distribution Let X {1, 2,..., J}. Estimate the probabilities p(1), p(2),..., p(j) of getting outcomes 1, 2,..., J. If in n trials, we observe n(1) outcomes of 1, n(2) of 2,..., n(j) of J, then the obvious guess is to estimate p(j) = n(j) n, This is also the maximum likelihood estimate. j = 1, 2,..., J Ad Feelders ( Universiteit Utrecht ) Data Mining 38 / 49
39 BN-Factorisation For a given BN-DAG, the joint distribution factorises according to k P(X ) = p(x i X pa(i) ) So to specify the distribution we have to estimate the probabilities i=1 p(x i X pa(i) ) i = 1, 2,..., k for the conditional distribution of each variable given its parents. Ad Feelders ( Universiteit Utrecht ) Data Mining 39 / 49
40 ML Estimation of BN The joint probability for n independent observations is P(X (1),..., X (n) ) = = n P(X (j) ) j=1 n k p(x (j) i j=1 i=1 X (j) pa(i) ), where X (j) denotes the j-th row in the data table. The likelihood function is therefore given by L = k i=1 x i,x pa(i) p(x i x pa(i) ) n(x i,x pa(i)) where n(x i, x pa(i) ) is a count of the number of records with X i = x i, and X pa(i) = x pa(i). Ad Feelders ( Universiteit Utrecht ) Data Mining 40 / 49
41 ML Estimation of BN Taking the log of the likelihood, we get L = k i=1 x i,x pa(i) n(x i, x pa(i) ) log p(x i x pa(i) ) Maximize the log-likelihood function with respect to the unknown parameters p(x i x pa(i) ). This decomposes into a collection of independent multinomial estimation problems. Separate estimation problem for each X i and configuration of X pa(i). Ad Feelders ( Universiteit Utrecht ) Data Mining 41 / 49
42 ML Estimation of BN The maximum likelihood estimate of p(x i x pa(i) ) is given by: ˆp(x i x pa(i) ) = n(x i, x pa(i) ) n(x pa(i) ), where n(x i, x pa(i) ) is the number of records in the data with X i = x i and X pa(i) = x pa(i), and n(x pa(i) ) is the number of records in the data with X pa(i) = x pa(i). Ad Feelders ( Universiteit Utrecht ) Data Mining 42 / 49
43 Example BN and Factorisation P(X 1, X 2, X 3, X 4 ) = p 1 (X 1 )p 2 (X 2 )p 3 12 (X 3 X 1, X 2 )p 4 3 (X 4 X 3 ) Ad Feelders ( Universiteit Utrecht ) Data Mining 43 / 49
44 Example BN: Parameters P(X 1, X 2, X 3, X 4 ) = p 1 (X 1 )p 2 (X 2 )p 3 12 (X 3 X 1, X 2 )p 4 3 (X 4 X 3 ) Now we have to estimate the following parameters (X 4 ternary, rest binary): p 1 (1) p 1 (2) = 1 p 1 (1) p 2 (1) p 2 (2) = 1 p 2 (1) p 3 1,2 (1 1, 1) p 3 1,2 (2 1, 1) = 1 p 3 1,2 (1 1, 1) p 3 1,2 (1 1, 2) p 3 1,2 (2 1, 2) = 1 p 3 1,2 (1 1, 2) p 3 1,2 (1 2, 1) p 3 1,2 (2 2, 1) = 1 p 3 1,2 (1 2, 1) p 3 1,2 (1 2, 2) p 3 1,2 (2 2, 2) = 1 p 3 1,2 (1 2, 2) p 4 3 (1 1) p 4 3 (2 1) p 4 3 (3 1) = 1 p 4 3 (1 1) p 4 3 (2 1) p 4 3 (1 2) p 4 3 (2 2) p 4 3 (3 2) = 1 p 4 3 (1 2) p 4 3 (2 2) Ad Feelders ( Universiteit Utrecht ) Data Mining 44 / 49
45 Example Data Set obs X 1 X 2 X 3 X Ad Feelders ( Universiteit Utrecht ) Data Mining 45 / 49
46 Maximum Likelihood Estimation obs X 1 X 2 X 3 X ˆp 1 (1) = n(x 1 = 1) n = 5 10 = 1 2 Ad Feelders ( Universiteit Utrecht ) Data Mining 46 / 49
47 Maximum Likelihood Estimation obs X 1 X 2 X 3 X ˆp 2 (1) = n(x 2 = 1) n = 6 10 Ad Feelders ( Universiteit Utrecht ) Data Mining 47 / 49
48 Maximum Likelihood Estimation obs X 1 X 2 X 3 X ˆp 3 1,2 (1 1, 1) = n(x 1 = 1, x 2 = 1, x 3 = 1) n(x 1 = 1, x 2 = 1) = 2 3 Ad Feelders ( Universiteit Utrecht ) Data Mining 48 / 49
49 Maximum Likelihood Estimation obs X 1 X 2 X 3 X ˆp 3 1,2 (1 1, 1) = n(x 1 = 1, x 2 = 1, x 3 = 1) n(x 1 = 1, x 2 = 1) = 2 3 Ad Feelders ( Universiteit Utrecht ) Data Mining 49 / 49
Graphical models and causality: Directed acyclic graphs (DAGs) and conditional (in)dependence
Graphical models and causality: Directed acyclic graphs (DAGs) and conditional (in)dependence General overview Introduction Directed acyclic graphs (DAGs) and conditional independence DAGs and causal effects
More informationMarkov properties for directed graphs
Graphical Models, Lecture 7, Michaelmas Term 2009 November 2, 2009 Definitions Structural relations among Markov properties Factorization G = (V, E) simple undirected graph; σ Say σ satisfies (P) the pairwise
More informationProbabilistic Graphical Models (I)
Probabilistic Graphical Models (I) Hongxin Zhang zhx@cad.zju.edu.cn State Key Lab of CAD&CG, ZJU 2015-03-31 Probabilistic Graphical Models Modeling many real-world problems => a large number of random
More informationIntroduction to Causal Calculus
Introduction to Causal Calculus Sanna Tyrväinen University of British Columbia August 1, 2017 1 / 1 2 / 1 Bayesian network Bayesian networks are Directed Acyclic Graphs (DAGs) whose nodes represent random
More informationChris Bishop s PRML Ch. 8: Graphical Models
Chris Bishop s PRML Ch. 8: Graphical Models January 24, 2008 Introduction Visualize the structure of a probabilistic model Design and motivate new models Insights into the model s properties, in particular
More informationProbabilistic Graphical Networks: Definitions and Basic Results
This document gives a cursory overview of Probabilistic Graphical Networks. The material has been gleaned from different sources. I make no claim to original authorship of this material. Bayesian Graphical
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 Outlines Overview Introduction Linear Algebra Probability Linear Regression
More informationDirected Graphical Models or Bayesian Networks
Directed Graphical Models or Bayesian Networks Le Song Machine Learning II: Advanced Topics CSE 8803ML, Spring 2012 Bayesian Networks One of the most exciting recent advancements in statistical AI Compact
More informationCS 2750: Machine Learning. Bayesian Networks. Prof. Adriana Kovashka University of Pittsburgh March 14, 2016
CS 2750: Machine Learning Bayesian Networks Prof. Adriana Kovashka University of Pittsburgh March 14, 2016 Plan for today and next week Today and next time: Bayesian networks (Bishop Sec. 8.1) Conditional
More informationDirected and Undirected Graphical Models
Directed and Undirected Davide Bacciu Dipartimento di Informatica Università di Pisa bacciu@di.unipi.it Machine Learning: Neural Networks and Advanced Models (AA2) Last Lecture Refresher Lecture Plan Directed
More informationCausal Inference & Reasoning with Causal Bayesian Networks
Causal Inference & Reasoning with Causal Bayesian Networks Neyman-Rubin Framework Potential Outcome Framework: for each unit k and each treatment i, there is a potential outcome on an attribute U, U ik,
More informationLecture 4 October 18th
Directed and undirected graphical models Fall 2017 Lecture 4 October 18th Lecturer: Guillaume Obozinski Scribe: In this lecture, we will assume that all random variables are discrete, to keep notations
More informationLearning in Bayesian Networks
Learning in Bayesian Networks Florian Markowetz Max-Planck-Institute for Molecular Genetics Computational Molecular Biology Berlin Berlin: 20.06.2002 1 Overview 1. Bayesian Networks Stochastic Networks
More informationProbabilistic Graphical Models
Probabilistic Graphical Models David Sontag New York University Lecture 4, February 16, 2012 David Sontag (NYU) Graphical Models Lecture 4, February 16, 2012 1 / 27 Undirected graphical models Reminder
More informationStochastic inference in Bayesian networks, Markov chain Monte Carlo methods
Stochastic inference in Bayesian networks, Markov chain Monte Carlo methods AI: Stochastic inference in BNs AI: Stochastic inference in BNs 1 Outline ypes of inference in (causal) BNs Hardness of exact
More informationSTA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Statistics! rsalakhu@utstat.toronto.edu! http://www.utstat.utoronto.ca/~rsalakhu/ Sidney Smith Hall, Room 6002 Lecture 3 Linear
More informationUndirected Graphical Models: Markov Random Fields
Undirected Graphical Models: Markov Random Fields 40-956 Advanced Topics in AI: Probabilistic Graphical Models Sharif University of Technology Soleymani Spring 2015 Markov Random Field Structure: undirected
More informationLecture 17: May 29, 2002
EE596 Pat. Recog. II: Introduction to Graphical Models University of Washington Spring 2000 Dept. of Electrical Engineering Lecture 17: May 29, 2002 Lecturer: Jeff ilmes Scribe: Kurt Partridge, Salvador
More information1. what conditional independencies are implied by the graph. 2. whether these independecies correspond to the probability distribution
NETWORK ANALYSIS Lourens Waldorp PROBABILITY AND GRAPHS The objective is to obtain a correspondence between the intuitive pictures (graphs) of variables of interest and the probability distributions of
More informationDirected Graphical Models
CS 2750: Machine Learning Directed Graphical Models Prof. Adriana Kovashka University of Pittsburgh March 28, 2017 Graphical Models If no assumption of independence is made, must estimate an exponential
More informationMachine Learning Lecture 14
Many slides adapted from B. Schiele, S. Roth, Z. Gharahmani Machine Learning Lecture 14 Undirected Graphical Models & Inference 23.06.2015 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de/ leibe@vision.rwth-aachen.de
More informationLecture 5: Bayesian Network
Lecture 5: Bayesian Network Topics of this lecture What is a Bayesian network? A simple example Formal definition of BN A slightly difficult example Learning of BN An example of learning Important topics
More informationMachine Learning 4771
Machine Learning 4771 Instructor: Tony Jebara Topic 16 Undirected Graphs Undirected Separation Inferring Marginals & Conditionals Moralization Junction Trees Triangulation Undirected Graphs Separation
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning Undirected Graphical Models Mark Schmidt University of British Columbia Winter 2016 Admin Assignment 3: 2 late days to hand it in today, Thursday is final day. Assignment 4:
More informationAn Introduction to Bayesian Machine Learning
1 An Introduction to Bayesian Machine Learning José Miguel Hernández-Lobato Department of Engineering, Cambridge University April 8, 2013 2 What is Machine Learning? The design of computational systems
More informationUndirected Graphical Models
Undirected Graphical Models 1 Conditional Independence Graphs Let G = (V, E) be an undirected graph with vertex set V and edge set E, and let A, B, and C be subsets of vertices. We say that C separates
More informationReview: Bayesian learning and inference
Review: Bayesian learning and inference Suppose the agent has to make decisions about the value of an unobserved query variable X based on the values of an observed evidence variable E Inference problem:
More informationA graph contains a set of nodes (vertices) connected by links (edges or arcs)
BOLTZMANN MACHINES Generative Models Graphical Models A graph contains a set of nodes (vertices) connected by links (edges or arcs) In a probabilistic graphical model, each node represents a random variable,
More information4.1 Notation and probability review
Directed and undirected graphical models Fall 2015 Lecture 4 October 21st Lecturer: Simon Lacoste-Julien Scribe: Jaime Roquero, JieYing Wu 4.1 Notation and probability review 4.1.1 Notations Let us recall
More information3 : Representation of Undirected GM
10-708: Probabilistic Graphical Models 10-708, Spring 2016 3 : Representation of Undirected GM Lecturer: Eric P. Xing Scribes: Longqi Cai, Man-Chia Chang 1 MRF vs BN There are two types of graphical models:
More informationCausal Models with Hidden Variables
Causal Models with Hidden Variables Robin J. Evans www.stats.ox.ac.uk/ evans Department of Statistics, University of Oxford Quantum Networks, Oxford August 2017 1 / 44 Correlation does not imply causation
More informationStatistical Approaches to Learning and Discovery
Statistical Approaches to Learning and Discovery Graphical Models Zoubin Ghahramani & Teddy Seidenfeld zoubin@cs.cmu.edu & teddy@stat.cmu.edu CALD / CS / Statistics / Philosophy Carnegie Mellon University
More informationCS Lecture 4. Markov Random Fields
CS 6347 Lecture 4 Markov Random Fields Recap Announcements First homework is available on elearning Reminder: Office hours Tuesday from 10am-11am Last Time Bayesian networks Today Markov random fields
More informationSTAT 598L Probabilistic Graphical Models. Instructor: Sergey Kirshner. Bayesian Networks
STAT 598L Probabilistic Graphical Models Instructor: Sergey Kirshner Bayesian Networks Representing Joint Probability Distributions 2 n -1 free parameters Reducing Number of Parameters: Conditional Independence
More informationUndirected Graphical Models
Outline Hong Chang Institute of Computing Technology, Chinese Academy of Sciences Machine Learning Methods (Fall 2012) Outline Outline I 1 Introduction 2 Properties Properties 3 Generative vs. Conditional
More informationCausal Directed Acyclic Graphs
Causal Directed Acyclic Graphs Kosuke Imai Harvard University STAT186/GOV2002 CAUSAL INFERENCE Fall 2018 Kosuke Imai (Harvard) Causal DAGs Stat186/Gov2002 Fall 2018 1 / 15 Elements of DAGs (Pearl. 2000.
More informationBayesian Networks (Part II)
10-601 Introduction to Machine Learning Machine Learning Department School of Computer Science Carnegie Mellon University Bayesian Networks (Part II) Graphical Model Readings: Murphy 10 10.2.1 Bishop 8.1,
More informationLecture 6: Graphical Models
Lecture 6: Graphical Models Kai-Wei Chang CS @ Uniersity of Virginia kw@kwchang.net Some slides are adapted from Viek Skirmar s course on Structured Prediction 1 So far We discussed sequence labeling tasks:
More informationThe Monte Carlo Method: Bayesian Networks
The Method: Bayesian Networks Dieter W. Heermann Methods 2009 Dieter W. Heermann ( Methods)The Method: Bayesian Networks 2009 1 / 18 Outline 1 Bayesian Networks 2 Gene Expression Data 3 Bayesian Networks
More informationImplementing Machine Reasoning using Bayesian Network in Big Data Analytics
Implementing Machine Reasoning using Bayesian Network in Big Data Analytics Steve Cheng, Ph.D. Guest Speaker for EECS 6893 Big Data Analytics Columbia University October 26, 2017 Outline Introduction Probability
More informationPart I. C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS
Part I C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS Probabilistic Graphical Models Graphical representation of a probabilistic model Each variable corresponds to a
More informationRapid Introduction to Machine Learning/ Deep Learning
Rapid Introduction to Machine Learning/ Deep Learning Hyeong In Choi Seoul National University 1/32 Lecture 5a Bayesian network April 14, 2016 2/32 Table of contents 1 1. Objectives of Lecture 5a 2 2.Bayesian
More informationChapter 16. Structured Probabilistic Models for Deep Learning
Peng et al.: Deep Learning and Practice 1 Chapter 16 Structured Probabilistic Models for Deep Learning Peng et al.: Deep Learning and Practice 2 Structured Probabilistic Models way of using graphs to describe
More informationInference in Bayesian networks
Inference in Bayesian networks AIMA2e hapter 14.4 5 1 Outline Exact inference by enumeration Exact inference by variable elimination Approximate inference by stochastic simulation Approximate inference
More informationApplying Bayesian networks in the game of Minesweeper
Applying Bayesian networks in the game of Minesweeper Marta Vomlelová Faculty of Mathematics and Physics Charles University in Prague http://kti.mff.cuni.cz/~marta/ Jiří Vomlel Institute of Information
More informationLearning from Sensor Data: Set II. Behnaam Aazhang J.S. Abercombie Professor Electrical and Computer Engineering Rice University
Learning from Sensor Data: Set II Behnaam Aazhang J.S. Abercombie Professor Electrical and Computer Engineering Rice University 1 6. Data Representation The approach for learning from data Probabilistic
More informationUC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics. EECS 281A / STAT 241A Statistical Learning Theory
UC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics EECS 281A / STAT 241A Statistical Learning Theory Solutions to Problem Set 1 Fall 2011 Issued: Thurs, September
More informationGraphical Models and Kernel Methods
Graphical Models and Kernel Methods Jerry Zhu Department of Computer Sciences University of Wisconsin Madison, USA MLSS June 17, 2014 1 / 123 Outline Graphical Models Probabilistic Inference Directed vs.
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Lecture Notes Fall 2009 November, 2009 Byoung-Ta Zhang School of Computer Science and Engineering & Cognitive Science, Brain Science, and Bioinformatics Seoul National University
More informationAlternative Parameterizations of Markov Networks. Sargur Srihari
Alternative Parameterizations of Markov Networks Sargur srihari@cedar.buffalo.edu 1 Topics Three types of parameterization 1. Gibbs Parameterization 2. Factor Graphs 3. Log-linear Models Features (Ising,
More informationLearning Bayesian networks
1 Lecture topics: Learning Bayesian networks from data maximum likelihood, BIC Bayesian, marginal likelihood Learning Bayesian networks There are two problems we have to solve in order to estimate Bayesian
More information2 : Directed GMs: Bayesian Networks
10-708: Probabilistic Graphical Models, Spring 2015 2 : Directed GMs: Bayesian Networks Lecturer: Eric P. Xing Scribes: Yi Cheng, Cong Lu 1 Notation Here the notations used in this course are defined:
More informationCOMS 4771 Probabilistic Reasoning via Graphical Models. Nakul Verma
COMS 4771 Probabilistic Reasoning via Graphical Models Nakul Verma Last time Dimensionality Reduction Linear vs non-linear Dimensionality Reduction Principal Component Analysis (PCA) Non-linear methods
More informationMachine Learning for Data Science (CS4786) Lecture 24
Machine Learning for Data Science (CS4786) Lecture 24 Graphical Models: Approximate Inference Course Webpage : http://www.cs.cornell.edu/courses/cs4786/2016sp/ BELIEF PROPAGATION OR MESSAGE PASSING Each
More informationCS 5522: Artificial Intelligence II
CS 5522: Artificial Intelligence II Bayes Nets: Independence Instructor: Alan Ritter Ohio State University [These slides were adapted from CS188 Intro to AI at UC Berkeley. All materials available at http://ai.berkeley.edu.]
More informationDAGS. f V f V 3 V 1, V 2 f V 2 V 0 f V 1 V 0 f V 0 (V 0, f V. f V m pa m pa m are the parents of V m. Statistical Dag: Example.
DAGS (V 0, 0,, V 1,,,V M ) V 0 V 1 V 2 V 3 Statistical Dag: f V Example M m 1 f V m pa m pa m are the parents of V m f V f V 3 V 1, V 2 f V 2 V 0 f V 1 V 0 f V 0 15 DAGS (V 0, 0,, V 1,,,V M ) V 0 V 1 V
More information1 : Introduction. 1 Course Overview. 2 Notation. 3 Representing Multivariate Distributions : Probabilistic Graphical Models , Spring 2014
10-708: Probabilistic Graphical Models 10-708, Spring 2014 1 : Introduction Lecturer: Eric P. Xing Scribes: Daniel Silva and Calvin McCarter 1 Course Overview In this lecture we introduce the concept of
More informationIntelligent Systems: Reasoning and Recognition. Reasoning with Bayesian Networks
Intelligent Systems: Reasoning and Recognition James L. Crowley ENSIMAG 2 / MoSIG M1 Second Semester 2016/2017 Lesson 13 24 march 2017 Reasoning with Bayesian Networks Naïve Bayesian Systems...2 Example
More informationInference in Graphical Models Variable Elimination and Message Passing Algorithm
Inference in Graphical Models Variable Elimination and Message Passing lgorithm Le Song Machine Learning II: dvanced Topics SE 8803ML, Spring 2012 onditional Independence ssumptions Local Markov ssumption
More informationBayesian Networks Introduction to Machine Learning. Matt Gormley Lecture 24 April 9, 2018
10-601 Introduction to Machine Learning Machine Learning Department School of Computer Science Carnegie Mellon University Bayesian Networks Matt Gormley Lecture 24 April 9, 2018 1 Homework 7: HMMs Reminders
More informationBayes Nets: Independence
Bayes Nets: Independence [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available at http://ai.berkeley.edu.] Bayes Nets A Bayes
More information4 : Exact Inference: Variable Elimination
10-708: Probabilistic Graphical Models 10-708, Spring 2014 4 : Exact Inference: Variable Elimination Lecturer: Eric P. ing Scribes: Soumya Batra, Pradeep Dasigi, Manzil Zaheer 1 Probabilistic Inference
More informationCS Lecture 3. More Bayesian Networks
CS 6347 Lecture 3 More Bayesian Networks Recap Last time: Complexity challenges Representing distributions Computing probabilities/doing inference Introduction to Bayesian networks Today: D-separation,
More informationIntroduction to Probabilistic Graphical Models
Introduction to Probabilistic Graphical Models Sargur Srihari srihari@cedar.buffalo.edu 1 Topics 1. What are probabilistic graphical models (PGMs) 2. Use of PGMs Engineering and AI 3. Directionality in
More informationLearning P-maps Param. Learning
Readings: K&F: 3.3, 3.4, 16.1, 16.2, 16.3, 16.4 Learning P-maps Param. Learning Graphical Models 10708 Carlos Guestrin Carnegie Mellon University September 24 th, 2008 10-708 Carlos Guestrin 2006-2008
More information2 : Directed GMs: Bayesian Networks
10-708: Probabilistic Graphical Models 10-708, Spring 2017 2 : Directed GMs: Bayesian Networks Lecturer: Eric P. Xing Scribes: Jayanth Koushik, Hiroaki Hayashi, Christian Perez Topic: Directed GMs 1 Types
More informationMessage Passing and Junction Tree Algorithms. Kayhan Batmanghelich
Message Passing and Junction Tree Algorithms Kayhan Batmanghelich 1 Review 2 Review 3 Great Ideas in ML: Message Passing Each soldier receives reports from all branches of tree 3 here 7 here 1 of me 11
More informationGraphical Models. Andrea Passerini Statistical relational learning. Graphical Models
Andrea Passerini passerini@disi.unitn.it Statistical relational learning Probability distributions Bernoulli distribution Two possible values (outcomes): 1 (success), 0 (failure). Parameters: p probability
More information{ p if x = 1 1 p if x = 0
Discrete random variables Probability mass function Given a discrete random variable X taking values in X = {v 1,..., v m }, its probability mass function P : X [0, 1] is defined as: P (v i ) = Pr[X =
More informationRepresentation of undirected GM. Kayhan Batmanghelich
Representation of undirected GM Kayhan Batmanghelich Review Review: Directed Graphical Model Represent distribution of the form ny p(x 1,,X n = p(x i (X i i=1 Factorizes in terms of local conditional probabilities
More informationAlternative Parameterizations of Markov Networks. Sargur Srihari
Alternative Parameterizations of Markov Networks Sargur srihari@cedar.buffalo.edu 1 Topics Three types of parameterization 1. Gibbs Parameterization 2. Factor Graphs 3. Log-linear Models with Energy functions
More informationConditional Independence
Conditional Independence Sargur Srihari srihari@cedar.buffalo.edu 1 Conditional Independence Topics 1. What is Conditional Independence? Factorization of probability distribution into marginals 2. Why
More informationBN Semantics 3 Now it s personal! Parameter Learning 1
Readings: K&F: 3.4, 14.1, 14.2 BN Semantics 3 Now it s personal! Parameter Learning 1 Graphical Models 10708 Carlos Guestrin Carnegie Mellon University September 22 nd, 2006 1 Building BNs from independence
More informationCS839: Probabilistic Graphical Models. Lecture 7: Learning Fully Observed BNs. Theo Rekatsinas
CS839: Probabilistic Graphical Models Lecture 7: Learning Fully Observed BNs Theo Rekatsinas 1 Exponential family: a basic building block For a numeric random variable X p(x ) =h(x)exp T T (x) A( ) = 1
More informationArtificial Intelligence Bayes Nets: Independence
Artificial Intelligence Bayes Nets: Independence Instructors: David Suter and Qince Li Course Delivered @ Harbin Institute of Technology [Many slides adapted from those created by Dan Klein and Pieter
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Lecture 4 Learning Bayesian Networks CS/CNS/EE 155 Andreas Krause Announcements Another TA: Hongchao Zhou Please fill out the questionnaire about recitations Homework 1 out.
More informationBayesian networks. Independence. Bayesian networks. Markov conditions Inference. by enumeration rejection sampling Gibbs sampler
Bayesian networks Independence Bayesian networks Markov conditions Inference by enumeration rejection sampling Gibbs sampler Independence if P(A=a,B=a) = P(A=a)P(B=b) for all a and b, then we call A and
More informationBayesian Networks. Vibhav Gogate The University of Texas at Dallas
Bayesian Networks Vibhav Gogate The University of Texas at Dallas Intro to AI (CS 6364) Many slides over the course adapted from either Dan Klein, Luke Zettlemoyer, Stuart Russell or Andrew Moore 1 Outline
More informationUsing Graphs to Describe Model Structure. Sargur N. Srihari
Using Graphs to Describe Model Structure Sargur N. srihari@cedar.buffalo.edu 1 Topics in Structured PGMs for Deep Learning 0. Overview 1. Challenge of Unstructured Modeling 2. Using graphs to describe
More informationAxioms of Probability? Notation. Bayesian Networks. Bayesian Networks. Today we ll introduce Bayesian Networks.
Bayesian Networks Today we ll introduce Bayesian Networks. This material is covered in chapters 13 and 14. Chapter 13 gives basic background on probability and Chapter 14 talks about Bayesian Networks.
More information1 Undirected Graphical Models. 2 Markov Random Fields (MRFs)
Machine Learning (ML, F16) Lecture#07 (Thursday Nov. 3rd) Lecturer: Byron Boots Undirected Graphical Models 1 Undirected Graphical Models In the previous lecture, we discussed directed graphical models.
More informationReview: Directed Models (Bayes Nets)
X Review: Directed Models (Bayes Nets) Lecture 3: Undirected Graphical Models Sam Roweis January 2, 24 Semantics: x y z if z d-separates x and y d-separation: z d-separates x from y if along every undirected
More informationInference in Bayesian Networks
Lecture 7 Inference in Bayesian Networks Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Slides by Stuart Russell and Peter Norvig Course Overview Introduction
More informationReasoning Under Uncertainty: Belief Network Inference
Reasoning Under Uncertainty: Belief Network Inference CPSC 322 Uncertainty 5 Textbook 10.4 Reasoning Under Uncertainty: Belief Network Inference CPSC 322 Uncertainty 5, Slide 1 Lecture Overview 1 Recap
More informationJunction Tree, BP and Variational Methods
Junction Tree, BP and Variational Methods Adrian Weller MLSALT4 Lecture Feb 21, 2018 With thanks to David Sontag (MIT) and Tony Jebara (Columbia) for use of many slides and illustrations For more information,
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Brown University CSCI 295-P, Spring 213 Prof. Erik Sudderth Lecture 11: Inference & Learning Overview, Gaussian Graphical Models Some figures courtesy Michael Jordan s draft
More informationNaïve Bayes classification
Naïve Bayes classification 1 Probability theory Random variable: a variable whose possible values are numerical outcomes of a random phenomenon. Examples: A person s height, the outcome of a coin toss
More informationRepresentation. Stefano Ermon, Aditya Grover. Stanford University. Lecture 2
Representation Stefano Ermon, Aditya Grover Stanford University Lecture 2 Stefano Ermon, Aditya Grover (AI Lab) Deep Generative Models Lecture 2 1 / 32 Learning a generative model We are given a training
More informationBayes Networks 6.872/HST.950
Bayes Networks 6.872/HST.950 What Probabilistic Models Should We Use? Full joint distribution Completely expressive Hugely data-hungry Exponential computational complexity Naive Bayes (full conditional
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Lecture 11 CRFs, Exponential Family CS/CNS/EE 155 Andreas Krause Announcements Homework 2 due today Project milestones due next Monday (Nov 9) About half the work should
More informationDirected and Undirected Graphical Models
Directed and Undirected Graphical Models Adrian Weller MLSALT4 Lecture Feb 26, 2016 With thanks to David Sontag (NYU) and Tony Jebara (Columbia) for use of many slides and illustrations For more information,
More informationBayesian Networks. Semantics of Bayes Nets. Example (Binary valued Variables) CSC384: Intro to Artificial Intelligence Reasoning under Uncertainty-III
CSC384: Intro to Artificial Intelligence Reasoning under Uncertainty-III Bayesian Networks Announcements: Drop deadline is this Sunday Nov 5 th. All lecture notes needed for T3 posted (L13,,L17). T3 sample
More informationProf. Dr. Lars Schmidt-Thieme, L. B. Marinho, K. Buza Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim, Germany, Course
Course on Bayesian Networks, winter term 2007 0/31 Bayesian Networks Bayesian Networks I. Bayesian Networks / 1. Probabilistic Independence and Separation in Graphs Prof. Dr. Lars Schmidt-Thieme, L. B.
More informationBayesian Networks. Vibhav Gogate The University of Texas at Dallas
Bayesian Networks Vibhav Gogate The University of Texas at Dallas Intro to AI (CS 4365) Many slides over the course adapted from either Dan Klein, Luke Zettlemoyer, Stuart Russell or Andrew Moore 1 Outline
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 Recitation 3 1 Gaussian Graphical Models: Schur s Complement Consider
More informationLecture 6: Graphical Models: Learning
Lecture 6: Graphical Models: Learning 4F13: Machine Learning Zoubin Ghahramani and Carl Edward Rasmussen Department of Engineering, University of Cambridge February 3rd, 2010 Ghahramani & Rasmussen (CUED)
More informationMachine Learning Summer School
Machine Learning Summer School Lecture 1: Introduction to Graphical Models Zoubin Ghahramani zoubin@eng.cam.ac.uk http://learning.eng.cam.ac.uk/zoubin/ epartment of ngineering University of ambridge, UK
More informationPreliminaries Bayesian Networks Graphoid Axioms d-separation Wrap-up. Bayesian Networks. Brandon Malone
Preliminaries Graphoid Axioms d-separation Wrap-up Much of this material is adapted from Chapter 4 of Darwiche s book January 23, 2014 Preliminaries Graphoid Axioms d-separation Wrap-up 1 Preliminaries
More informationGraphical Models - Part I
Graphical Models - Part I Oliver Schulte - CMPT 726 Bishop PRML Ch. 8, some slides from Russell and Norvig AIMA2e Outline Probabilistic Models Bayesian Networks Markov Random Fields Inference Outline Probabilistic
More informationGenerative and Discriminative Approaches to Graphical Models CMSC Topics in AI
Generative and Discriminative Approaches to Graphical Models CMSC 35900 Topics in AI Lecture 2 Yasemin Altun January 26, 2007 Review of Inference on Graphical Models Elimination algorithm finds single
More information