?? marginal_nodes.m
字號:
function marginal = marginal_nodes(engine, b, nodes, t, add_ev, is_fam)% function marginal = marginal_nodes(engine, b, nodes, t, add_ev, is_fam) (jtree_2TBN)if nargin < 6, is_fam = 0; endss = engine.slice_size;if ~is_fam & (t > 1) & all(nodes<=ss) nodes = nodes + ss;endif t==1 c = clq_containing_nodes(engine.jtree_engine1, nodes, is_fam);else c = clq_containing_nodes(engine.jtree_engine, nodes, is_fam);endif c == -1 error(['no clique contains ' nodes])endbigpot = b.clpot{c};pot = marginalize_pot(bigpot, nodes, engine.maximize);marginal = pot_to_marginal(pot);% we convert the domain to the unrolled numbering system% so that add_ev_to_dmarginal (maybe called in update_ess) extracts the right evidence.if t > 1 marginal.domain = nodes+(t-2)*engine.slice_size;endassert(~add_ev);
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -