annotate toolboxes/FullBNT-1.0.7/bnt/examples/dynamic/jtree_clq_test.m @ 0:cc4b1211e677 tip

initial commit to HG from Changeset: 646 (e263d8a21543) added further path and more save "camirversion.m"
author Daniel Wolff
date Fri, 19 Aug 2016 13:07:06 +0200
parents
children
rev   line source
Daniel@0 1 % Construct various DBNs and examine their clique structure.
Daniel@0 2 % This was used to generate various figures in chap 3-4 of my thesis.
Daniel@0 3
Daniel@0 4 % Examine the cliques in the unrolled mildew net
Daniel@0 5
Daniel@0 6 %dbn = mk_mildew_dbn;
Daniel@0 7 dbn = mk_chmm(4);
Daniel@0 8 ss = dbn.nnodes_per_slice;
Daniel@0 9 T = 7;
Daniel@0 10 N = ss*T;
Daniel@0 11 bnet = dbn_to_bnet(dbn, T);
Daniel@0 12
Daniel@0 13 constrained = 0;
Daniel@0 14 if constrained
Daniel@0 15 stages = num2cell(unroll_set(1:ss, ss, T), 1);
Daniel@0 16 else
Daniel@0 17 stages = { 1:N; };
Daniel@0 18 end
Daniel@0 19 clusters = {};
Daniel@0 20 %[jtree, root, cliques, B, w, elim_order, moral_edges, fill_in_edges] = ...
Daniel@0 21 % dag_to_jtree(bnet, bnet.observed, stages, clusters);
Daniel@0 22 [jtree, root, cliques] = graph_to_jtree(moralize(bnet.dag), ones(1,N), stages, clusters);
Daniel@0 23
Daniel@0 24 flip=1;
Daniel@0 25 clf;[dummyx, dummyy, h] = draw_dbn(dbn.intra, dbn.inter, flip, T, -1);
Daniel@0 26 dir = '/home/eecs/murphyk/WP/Thesis/Figures/Inf/MildewUnrolled';
Daniel@0 27 mk_ps_from_clqs(dbn, T, cliques, [])
Daniel@0 28 %mk_collage_from_clqs(dir, cliques)
Daniel@0 29
Daniel@0 30
Daniel@0 31 % Examine the cliques in the cascade DBN
Daniel@0 32
Daniel@0 33 % A-A
Daniel@0 34 % \
Daniel@0 35 % B B
Daniel@0 36 % \
Daniel@0 37 % C C
Daniel@0 38 % \
Daniel@0 39 % D D
Daniel@0 40 ss = 4;
Daniel@0 41 intra = zeros(ss);
Daniel@0 42 inter = zeros(ss);
Daniel@0 43 inter(1, [1 2])=1;
Daniel@0 44 for i=2:ss-1
Daniel@0 45 inter(i,i+1)=1;
Daniel@0 46 end
Daniel@0 47
Daniel@0 48
Daniel@0 49 % 2 coupled HMMs 1,3 and 2,4
Daniel@0 50 ss = 4;
Daniel@0 51 intra = zeros(ss);
Daniel@0 52 inter = zeros(ss); % no persistent edges
Daniel@0 53 %inter = diag(ones(ss,1)); % persitence edges
Daniel@0 54 inter(1,3)=1; inter(3,1)=1;
Daniel@0 55 inter(2,4)=1; inter(4,2)=1;
Daniel@0 56
Daniel@0 57 %bnet = mk_fhmm(3);
Daniel@0 58 bnet = mk_chmm(4);
Daniel@0 59 intra = bnet.intra;
Daniel@0 60 inter = bnet.inter;
Daniel@0 61
Daniel@0 62 clqs = compute_minimal_interface(intra, inter);
Daniel@0 63 celldisp(clqs)
Daniel@0 64
Daniel@0 65
Daniel@0 66
Daniel@0 67
Daniel@0 68 % A A
Daniel@0 69 % \
Daniel@0 70 % B B
Daniel@0 71 % \
Daniel@0 72 % C C
Daniel@0 73 % \
Daniel@0 74 % D-D
Daniel@0 75 ss = 4;
Daniel@0 76 intra = zeros(ss);
Daniel@0 77 inter = zeros(ss);
Daniel@0 78 for i=1:ss-1
Daniel@0 79 inter(i,i+1)=1;
Daniel@0 80 end
Daniel@0 81 inter(4,4)=1;
Daniel@0 82
Daniel@0 83
Daniel@0 84
Daniel@0 85 ns = 2*ones(1,ss);
Daniel@0 86 dbn = mk_dbn(intra, inter, ns);
Daniel@0 87 for i=2*ss
Daniel@0 88 dbn.CPD{i} = tabular_CPD(bnet, i);
Daniel@0 89 end
Daniel@0 90
Daniel@0 91 T = 4;
Daniel@0 92 N = ss*T;
Daniel@0 93 bnet = dbn_to_bnet(dbn, T);
Daniel@0 94
Daniel@0 95 constrained = 1;
Daniel@0 96 if constrained
Daniel@0 97 % elim first 3 slices first in any order
Daniel@0 98 stages = {1:12, 13:16};
Daniel@0 99 %stages = num2cell(unroll_set(1:ss, ss, T), 1);
Daniel@0 100 else
Daniel@0 101 stages = { 1:N; };
Daniel@0 102 end
Daniel@0 103 clusters = {};
Daniel@0 104 %[jtree, root, cliques, B, w, elim_order, moral_edges, fill_in_edges] = ...
Daniel@0 105 % dag_to_jtree(bnet, bnet.observed, stages, clusters);
Daniel@0 106 [jtree, root, cliques] = graph_to_jtree(moralize(bnet.dag), ones(1,N), stages, clusters);
Daniel@0 107
Daniel@0 108
Daniel@0 109
Daniel@0 110
Daniel@0 111
Daniel@0 112 % Examine the cliques in the 1.5 slice DBN
Daniel@0 113
Daniel@0 114 %dbn = mk_mildew_dbn;
Daniel@0 115 dbn = mk_water_dbn;
Daniel@0 116 %dbn = mk_bat_dbn;
Daniel@0 117 ss = dbn.nnodes_per_slice;
Daniel@0 118 int = compute_fwd_interface(dbn);
Daniel@0 119 bnet15 = mk_slice_and_half_dbn(dbn, int);
Daniel@0 120 N = length(bnet15.dag);
Daniel@0 121 stages = {1:N};
Daniel@0 122
Daniel@0 123 % bat
Daniel@0 124 %cl1 = [16 17 19 7 14];
Daniel@0 125 %cl2 = [27 25 21 23 20];
Daniel@0 126 %clusters = {cl1, cl2, cl1+ss, cl2+ss};
Daniel@0 127
Daniel@0 128 % water
Daniel@0 129 %cl1 = 1:2; cl2 = 3:6; cl3 = 7:8;
Daniel@0 130 %clusters = {cl1, cl2, cl3, cl1+ss, cl2+ss, cl3+ss};
Daniel@0 131
Daniel@0 132 %clusters = {};
Daniel@0 133 clusters = {int, int+ss};
Daniel@0 134 %[jtree, root, cliques, B, w, elim_order, moral_edges, fill_in_edges] = ...
Daniel@0 135 % dag_to_jtree(bnet15, bnet.observed, stages, clusters);
Daniel@0 136 [jtree, root, cliques] = graph_to_jtree(moralize(bnet15.dag), ones(1,N), stages, clusters);
Daniel@0 137
Daniel@0 138 clq_len = [];
Daniel@0 139 for c=1:length(cliques)
Daniel@0 140 clq_len(c) = length(cliques{c});
Daniel@0 141 end
Daniel@0 142 hist(clq_len, 1:max(clq_len));
Daniel@0 143 h=hist(clq_len, 1:max(clq_len));
Daniel@0 144 axis([1 max(clq_len)+1 0 max(h)+1])
Daniel@0 145 xlabel('clique size','fontsize',16)
Daniel@0 146 ylabel('number','fontsize',16)
Daniel@0 147
Daniel@0 148
Daniel@0 149
Daniel@0 150