diff toolboxes/FullBNT-1.0.7/bnt/examples/static/Belprop/bp1.m @ 0:e9a9cd732c1e tip

first hg version after svn

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/toolboxes/FullBNT-1.0.7/bnt/examples/static/Belprop/bp1.m	Tue Feb 10 15:05:51 2015 +0000
@@ -0,0 +1,24 @@
+% Compare different loopy belief propagation algorithms on a graph with a single loop.
+% LBP should give exact results if it converges.
+
+seed = 0;
+rand('state', seed);
+randn('state', seed);
+
+N = 2;
+dag = zeros(N,N);
+dag(1,2)=1;
+ns = ones(1,N); 
+bnet = mk_bnet(dag, ns, 'discrete', []);
+for i=1:N
+  %bnet.CPD{i} = gaussian_CPD(bnet, i, 'mean', 0);
+  bnet.CPD{i} = gaussian_CPD(bnet, i);
+end
+
+engines = {};
+engines{end+1} = jtree_inf_engine(bnet);
+engines{end+1} = pearl_inf_engine(bnet, 'protocol', 'tree');
+
+[time, engines] = cmp_inference_static(bnet, engines, 'maximize', 0, 'exact', 1:2, 'observed', [2], ...
+				   'check_ll', 0, 'singletons_only', 1, 'check_converged', []);
+