bayes network: inference Flashcards

(16 cards)

1
Q

what is diagnosis in bayes network

A

P(Cause | Effect)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

what is Prediction in bayes network

A

P(Effect | Cause)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

applications of inference in bayes network

A

classification maxclassP(class | data)
decision making: P(effect | Cause ) x Utility(Effect | Cause)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

what is marginal distribution

A

a distribution formed by calculating the subset of a larger probability

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

what are the 3 categories of variables

A

evidence variables
query variables
non - evidence variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what is a evidence variable

A

known variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

what is a query variable

A

wanted variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

what is a non evidence variable

A

neither known nor wanted , but must deal with

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

what are the complete set of variables in bayes network

A

E U X U Y
basically all 3 variables together

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

what is exact inference equation

A

P(X | E) = α·P(X ,E ) = α·P(X ,E ) = α· sumof Y
P(X ,E ,Y )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

what does α in exact inference

A

α = 1 / P (E)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

how do we find discrete random variables in marginalisation

A

we sum over unwanted variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

how do we find continuous random variables in marginalisation

A

integrate over unwanted variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

what is exact inference in general

A

Bayesian inference algorithms that calculate the exact
value of probability P(X |E )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

inference by enumeration

A

We infer a posterior probability by marginalization of the joint distribution.
That is, we compute the exact value of probability P(X |E ) using the
equation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

computational complexity

A

The number of terms in the sum is exponential in the number of
non-evidence random variables: The complexity is O(nmn), where:
▶ n is the number of non-evidence variables.
▶ m is the number of values each variable can take.