Transcript CausalGraphicalModel..

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
true graph
initial network
keep edge
and
so on
move to next edge
17
After all zero order conditional
independence tests
The algorithm then moves to first
order conditional independence tests.
18
true graph
Move to
next edge
drop edge
19
true graph
keep edge
keep edge
change cond set
20
After all first order
conditional independence tests.
The algorithm then moves to second
order conditional independence tests.
21
true graph
move to
next edge
drop edge
22
After all second order
conditional independence tests
Then the algorithm moves
to third order, fourth order …
23
24
25
26
27
28
true graph
29
30
31
32
33
34
35
36
k
save
k+1
save
k+2
37
37
select edge
drop edge
identify parents
orphan nodes
reverse edge
find new parents
from Grzegorczyk and Husmier (2008)
38
Trace plots of the logarithmic scores of the DAGs after the burn-in phase.
from Grzegorczyk and Husmier (2008)
39
40
41
42
43
44
R/qtlnet available at CRAN
45
46
47
48