Daniel@0: % Compare various inference engines on the following network (from Jensen (1996) p84 fig 4.17)
Daniel@0: %    1
Daniel@0: %  / | \
Daniel@0: % 2  3  4
Daniel@0: % |  |  |
Daniel@0: % 5  6  7
Daniel@0: %  \/ \/
Daniel@0: %  8   9
Daniel@0: % where all arcs point downwards
Daniel@0: 
Daniel@0: N = 9;
Daniel@0: dag = zeros(N,N);
Daniel@0: dag(1,2)=1; dag(1,3)=1; dag(1,4)=1;
Daniel@0: dag(2,5)=1; dag(3,6)=1; dag(4,7)=1;
Daniel@0: dag(5,8)=1; dag(6,8)=1; dag(6,9)=1; dag(7,9) = 1;
Daniel@0: 
Daniel@0: dnodes = 1:N;
Daniel@0: false = 1; true = 2;
Daniel@0: ns = 2*ones(1,N); % binary nodes
Daniel@0: 
Daniel@0: onodes = [2 7];
Daniel@0: bnet = mk_bnet(dag, ns, 'observed', onodes);
Daniel@0: % use random params
Daniel@0: for i=1:N
Daniel@0:   bnet.CPD{i} = tabular_CPD(bnet, i);
Daniel@0: end
Daniel@0: 
Daniel@0: query = [3];
Daniel@0: engine = {};
Daniel@0: engine{end+1} = jtree_inf_engine(bnet);
Daniel@0: engine{end+1} = var_elim_inf_engine(bnet);
Daniel@0: %engine{end+1} = global_joint_inf_engine(bnet);
Daniel@0: % global joint is designed for limids because does not normalize
Daniel@0: 
Daniel@0: %engine{end+1} = enumerative_inf_engine(bnet);
Daniel@0: %engine{end+1} = jtree_onepass_inf_engine(bnet, query, onodes);
Daniel@0: 
Daniel@0: maximize = 0;  % jtree_ndx crashes on max-prop
Daniel@0: [err, time] = cmp_inference_static(bnet, engine, 'maximize', maximize);
Daniel@0: