annotate toolboxes/FullBNT-1.0.7/bnt/examples/static/Models/mk_minimal_qmr_bnet.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 function [bnet, vals] = mk_minimal_qmr_bnet(G, inhibit, leak, prior, pos, neg, pos_only)
Daniel@0 2 % MK_MINIMAL_QMR_BNET Make a QMR model which only contains the observed findings
Daniel@0 3 % [bnet, vals] = mk_minimal_qmr_bnet(G, inhibit, prior, leak, pos, neg)
Daniel@0 4 %
Daniel@0 5 % Input:
Daniel@0 6 % G(i,j) = 1 iff there is an arc from disease i to finding j
Daniel@0 7 % inhibit(i,j) = inhibition probability on i->j arc
Daniel@0 8 % leak(j) = inhibition prob. on leak->j arc
Daniel@0 9 % prior(i) = prob. disease i is on
Daniel@0 10 % pos = list of leaves that have positive observations
Daniel@0 11 % neg = list of leaves that have negative observations
Daniel@0 12 % pos_only = 1 means only include positively observed leaves in the model - the negative
Daniel@0 13 % ones are absorbed into the prior terms
Daniel@0 14 %
Daniel@0 15 % Output:
Daniel@0 16 % bnet
Daniel@0 17 % vals is their value
Daniel@0 18
Daniel@0 19 if pos_only
Daniel@0 20 obs = pos;
Daniel@0 21 else
Daniel@0 22 obs = myunion(pos, neg);
Daniel@0 23 end
Daniel@0 24 Nfindings = length(obs);
Daniel@0 25 [Ndiseases maxNfindings] = size(inhibit);
Daniel@0 26 N = Ndiseases + Nfindings;
Daniel@0 27 finding_node = Ndiseases+1:N;
Daniel@0 28
Daniel@0 29 % j = finding_node(i) means the i'th finding node is the j'th node in the bnet
Daniel@0 30 % k = obs(i) means the i'th observed (positive) finding is the k'th finding overall
Daniel@0 31 % If all findings are observed, and posonly = 0, we have i = obs(i) for all i.
Daniel@0 32
Daniel@0 33 %dag = sparse(N, N);
Daniel@0 34 dag = zeros(N, N);
Daniel@0 35 dag(1:Ndiseases, Ndiseases+1:N) = G(:,obs);
Daniel@0 36
Daniel@0 37 ns = 2*ones(1,N);
Daniel@0 38 bnet = mk_bnet(dag, ns, 'observed', finding_node);
Daniel@0 39
Daniel@0 40 CPT = cell(1, Ndiseases);
Daniel@0 41 for d=1:Ndiseases
Daniel@0 42 CPT{d} = [1-prior(d) prior(d)];
Daniel@0 43 end
Daniel@0 44
Daniel@0 45 if pos_only
Daniel@0 46 % Fold in the negative evidence into the prior
Daniel@0 47 for i=1:length(neg)
Daniel@0 48 n = neg(i);
Daniel@0 49 ps = parents(G,n);
Daniel@0 50 for pi=1:length(ps)
Daniel@0 51 p = ps(pi);
Daniel@0 52 q = inhibit(p,n);
Daniel@0 53 CPT{p} = CPT{p} .* [1 q];
Daniel@0 54 end
Daniel@0 55 % Arbitrarily attach the leak term to the first parent
Daniel@0 56 p = ps(1);
Daniel@0 57 q = leak(n);
Daniel@0 58 CPT{p} = CPT{p} .* [q q];
Daniel@0 59 end
Daniel@0 60 end
Daniel@0 61
Daniel@0 62 for d=1:Ndiseases
Daniel@0 63 bnet.CPD{d} = tabular_CPD(bnet, d, CPT{d}');
Daniel@0 64 end
Daniel@0 65
Daniel@0 66 for i=1:Nfindings
Daniel@0 67 fnode = finding_node(i);
Daniel@0 68 fid = obs(i);
Daniel@0 69 ps = parents(G, fid);
Daniel@0 70 bnet.CPD{fnode} = noisyor_CPD(bnet, fnode, leak(fid), inhibit(ps, fid));
Daniel@0 71 end
Daniel@0 72
Daniel@0 73 obs_nodes = finding_node;
Daniel@0 74 vals = sparse(1, maxNfindings);
Daniel@0 75 vals(pos) = 2;
Daniel@0 76 vals(neg) = 1;
Daniel@0 77 vals = full(vals(obs));
Daniel@0 78
Daniel@0 79
Daniel@0 80
Daniel@0 81
Daniel@0 82