annotate toolboxes/FullBNT-1.0.7/bnt/examples/static/Belprop/bp1.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 % Compare different loopy belief propagation algorithms on a graph with a single loop.
Daniel@0 2 % LBP should give exact results if it converges.
Daniel@0 3
Daniel@0 4 seed = 0;
Daniel@0 5 rand('state', seed);
Daniel@0 6 randn('state', seed);
Daniel@0 7
Daniel@0 8 N = 2;
Daniel@0 9 dag = zeros(N,N);
Daniel@0 10 dag(1,2)=1;
Daniel@0 11 ns = ones(1,N);
Daniel@0 12 bnet = mk_bnet(dag, ns, 'discrete', []);
Daniel@0 13 for i=1:N
Daniel@0 14 %bnet.CPD{i} = gaussian_CPD(bnet, i, 'mean', 0);
Daniel@0 15 bnet.CPD{i} = gaussian_CPD(bnet, i);
Daniel@0 16 end
Daniel@0 17
Daniel@0 18 engines = {};
Daniel@0 19 engines{end+1} = jtree_inf_engine(bnet);
Daniel@0 20 engines{end+1} = pearl_inf_engine(bnet, 'protocol', 'tree');
Daniel@0 21
Daniel@0 22 [time, engines] = cmp_inference_static(bnet, engines, 'maximize', 0, 'exact', 1:2, 'observed', [2], ...
Daniel@0 23 'check_ll', 0, 'singletons_only', 1, 'check_converged', []);
Daniel@0 24