Mercurial > hg > camir-aes2014
view toolboxes/FullBNT-1.0.7/bnt/inference/dynamic/@pearl_dbn_inf_engine/marginal_nodes.m @ 0:e9a9cd732c1e tip
first hg version after svn
author | wolffd |
---|---|
date | Tue, 10 Feb 2015 15:05:51 +0000 |
parents | |
children |
line wrap: on
line source
function marginal = marginal_nodes(engine, nodes, t) % MARGINAL_NODES Compute the marginal on the specified query nodes (pearl_dbn) % marginal = marginal_nodes(engine, i, t) % returns Pr(X(i,t) | Y(1:T)), where X(i,t) is the i'th node in the t'th slice. % If enter_evidence used filtering instead of smoothing, this will return Pr(X(i,t) | Y(1:t)). if nargin < 3, t = 1; end assert(length(nodes)==1); i = nodes(end); if ~myismember(i, engine.onodes) marginal.T = engine.marginal{i,t}; else marginal.T = 1; % observed end % we convert the domain to the unrolled numbering system % so that update_ess extracts the right evidence. marginal.domain = nodes+(t-1)*engine.ss;