Markov Networks Flashcards

1
Q

What is the problem with directed models?

A

Directed models not optimal for mutual, symmetric dependencies

(see figure)

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

What are is a markov random field?

A

See figure

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

What are the use cases of mutual, symmetric dependencies?

A

social networks,

image processing

etc.

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

How are markov random field different than normal bayesian networks?

A

bayesian networks require a DAG (directed acyclic graph)

In markov random fields the graph is undirected, and we here deal with a set of clique potentials that determines how the connections can be established

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

How does conditional independence work in markov random fields / markov networks?

A

See figure - will explain it.

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

Can we sometimes loose information by converting a bayesian network to a MN?

A

Yes!

An example is in the figure where we see that we must create a connection between A and B for it to make sense. Thereby loosing information.

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

What is the partitioning function and why do we use it?

A

For each node we have some local amount of compatibility to each other node. We then use the function that adds up these compatibilities for each setting. These will give us some scores not going from 0 to 1. We use the partitioning function as a way of normalizing, these scores and thereby getting a value from 0 to 1 for each.

Please see figure.

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

So we have our probability distribution now, how can we say anything about the model?

A

As an example shown in the figure. We can say that even though A and B tend to agree, they are more likely to agree with D and C respectively. Therefore A and B will most likely disagree since they are more influenced by the other nodes.

see figure

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

Are bayesian networks and markov networks in the same space?

A

Not quite. They are overlapping, but since we lose information by going form BN to MN, we can conclude that they have shared space, but are not equivalent. (imagine two overlapping cirles - like in intersection).

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

What are gibbs samling?

A

Since it can be hard to estimate the network structure, we can use gibbs sampling to obtain a sequence of observations.

This sequence can be used to approximate the joint distribution

https://www.youtube.com/watch?v=QaojSzk7Hpw

A full and fun explanation is available at:

https://stats.stackexchange.com/questions/10213/can-someone-explain-gibbs-sampling-in-very-simple-words

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

Briefly explain the iising model

A

Nodes in a grid network represent atoms that either spins in a positive or negative direction. All of these nodes has a clique potential, and an option is even to have a single nodes as a clique by involving external magnetic fields.

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