annotate toolboxes/FullBNT-1.0.7/bnt/examples/static/fgraph/fg3.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 % make a factor graph corresponding to an HMM with Gaussian outputs, where we absorb the
Daniel@0 2 % evidence up front
Daniel@0 3
Daniel@0 4 seed = 1;
Daniel@0 5 rand('state', seed);
Daniel@0 6 randn('state', seed);
Daniel@0 7
Daniel@0 8 T = 3;
Daniel@0 9 Q = 3;
Daniel@0 10 O = 2;
Daniel@0 11 cts_obs = 1;
Daniel@0 12 param_tying = 1;
Daniel@0 13 bnet = mk_hmm_bnet(T, Q, O, cts_obs, param_tying);
Daniel@0 14 N = 2*T;
Daniel@0 15 onodes = bnet.observed;
Daniel@0 16 hnodes = mysetdiff(1:N, onodes);
Daniel@0 17
Daniel@0 18 data = sample_bnet(bnet);
Daniel@0 19
Daniel@0 20 init_factor = bnet.CPD{1};
Daniel@0 21 obs_factor = bnet.CPD{3};
Daniel@0 22 edge_factor = bnet.CPD{2}; % trans matrix
Daniel@0 23
Daniel@0 24 nfactors = T;
Daniel@0 25 nvars = T; % hidden only
Daniel@0 26 G = zeros(nvars, nfactors);
Daniel@0 27 G(1,1) = 1;
Daniel@0 28 for t=1:T-1
Daniel@0 29 G(t:t+1, t+1)=1;
Daniel@0 30 end
Daniel@0 31
Daniel@0 32 node_sizes = Q*ones(1,T);
Daniel@0 33
Daniel@0 34 % We tie params as follows:
Daniel@0 35 % the first hidden node use init_factor (number 1)
Daniel@0 36 % all hidden nodes on the backbone use edge_factor (number 2)
Daniel@0 37 % all observed nodes use the same factor, namely obs_factor
Daniel@0 38
Daniel@0 39 small_fg = mk_fgraph_given_ev(G, node_sizes, {init_factor, edge_factor}, {obs_factor}, data(onodes), ...
Daniel@0 40 'equiv_class', [1 2*ones(1,T-1)], 'ev_equiv_class', ones(1,T));
Daniel@0 41
Daniel@0 42 small_bnet = fgraph_to_bnet(small_fg);
Daniel@0 43
Daniel@0 44 % don't pre-process evidence
Daniel@0 45 % big_fg = bnet_to_fgraph(bnet); % can't handle Gaussian node
Daniel@0 46
Daniel@0 47
Daniel@0 48 engine = {};
Daniel@0 49 engine{1} = jtree_inf_engine(bnet);
Daniel@0 50 engine{2} = belprop_fg_inf_engine(small_fg, 'max_iter', 2*T);
Daniel@0 51 engine{3} = jtree_inf_engine(small_bnet);
Daniel@0 52 nengines = length(engine);
Daniel@0 53
Daniel@0 54
Daniel@0 55 % on BN, use the original evidence
Daniel@0 56 evidence = cell(1, 2*T);
Daniel@0 57 evidence(onodes) = data(onodes);
Daniel@0 58 tic; [engine{1}, ll(1)] = enter_evidence(engine{1}, evidence); toc
Daniel@0 59
Daniel@0 60
Daniel@0 61 % on small_fg, we have already included the evidence
Daniel@0 62 evidence = cell(1,T);
Daniel@0 63 tic; [engine{2}, ll(2)] = enter_evidence(engine{2}, evidence); toc
Daniel@0 64
Daniel@0 65
Daniel@0 66 % on small_bnet, we must add evidence to the dummy nodes
Daniel@0 67 V = small_fg.nvars;
Daniel@0 68 dummy = V+1:V+small_fg.nfactors;
Daniel@0 69 N = max(dummy);
Daniel@0 70 evidence = cell(1, N);
Daniel@0 71 evidence(dummy) = {1};
Daniel@0 72 tic; [engine{3}, ll(3)] = enter_evidence(engine{3}, evidence); toc
Daniel@0 73
Daniel@0 74
Daniel@0 75
Daniel@0 76 marg = zeros(T, nengines, Q); % marg(t,e,:)
Daniel@0 77 for t=1:T
Daniel@0 78 for e=1:nengines
Daniel@0 79 m = marginal_nodes(engine{e}, t);
Daniel@0 80 marg(t,e,:) = m.T;
Daniel@0 81 end
Daniel@0 82 end
Daniel@0 83 marg(:,:,1)