Question: probabilistic graphical models. data science. Let us say that we have a positive distribution on N random variables X1,X2,,XN. We would like to construct a

probabilistic graphical models. data science.
Let us say that we have a positive distribution on N random variables X1,X2,,XN. We would like to construct a minimal I-map for this distribution using the concept of pairwiseindependencies. Assuming that each random variable is m-valued, and that each arithmetic operation (addition/subtraction/division/multiplication) takes time c, calculate the total time taken to construct the minimal I-map from the given distribution. [6 Marks]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
