代码搜索：Inference
找到约 1,820 项符合「Inference」的源代码
代码结果 1,820
www.eeworm.com/read/133943/5897338
m bkff1.m
% Compare different implementations of fully factored Boyen Koller
water = 1;
if water
bnet = mk_water_dbn;
else
N = 5;
Q = 2;
Y = 2;
bnet = mk_chmm(N, Q, Y);
end
ss = length(bnet.intra);
www.eeworm.com/read/338238/12317133
m cform2sparsecell.m
function sc = cform2SparseCell(pairwiseData,adjCell)
% convert the pairwise-data (like pairwise beliefs) written by c_inference
% to sparse_cell
N = size(adjCell,2);
sc = sparse_cell(N,N);
for i=1:N
www.eeworm.com/read/160391/5571131
m gaussian1.m
% Make the following network (from Jensen (1996) p84 fig 4.17)
% 1
% / | \
% 2 3 4
% | | |
% 5 6 7
% \/ \/
% 8 9
% where all arcs point downwards
N = 9;
dag = zeros(N,N);
www.eeworm.com/read/160391/5571196
m bkff1.m
% Compare different implementations of fully factored Boyen Koller
water = 1;
if water
bnet = mk_water_dbn;
else
N = 5;
Q = 2;
Y = 2;
bnet = mk_chmm(N, Q, Y);
end
ss = length(bne
www.eeworm.com/read/389692/8507152
m ruleview.m
function ruleview(action, input, figNumber);
%RULEVIEW Rule viewer and fuzzy inference diagram.
% RULEVIEW(fis) opens the Rule Viewer, or Inference Diagram
% Viewer, for the fuzzy inference sys
www.eeworm.com/read/359005/10171525
m ruleview.m
function ruleview(action, input, figNumber);
%RULEVIEW Rule viewer and fuzzy inference diagram.
% RULEVIEW(fis) opens the Rule Viewer, or Inference Diagram
% Viewer, for the fuzzy inference sys
www.eeworm.com/read/123143/14645368
m ruleview.m
function ruleview(action, input, figNumber);
%RULEVIEW Rule viewer and fuzzy inference diagram.
% RULEVIEW(FIS) opens the Rule Viewer, or Inference Diagram
% Viewer, for the fuzzy inference sys
www.eeworm.com/read/334076/12642791
m ruleview.m
function ruleview(action, input, figNumber);
%RULEVIEW Rule viewer and fuzzy inference diagram.
% RULEVIEW(FIS) opens the Rule Viewer, or Inference Diagram
% Viewer, for the fuzzy inference sys
www.eeworm.com/read/140847/5779077
m belprop_loopy_gauss.m
% Compare different loopy belief propagation algorithms on a graph with many loops
% If LBP converges, the means should be exact
bnet = mk_asia_bnet('gauss');
engines = {};
engines{end+1} = jtree_in
www.eeworm.com/read/140847/5779079
m belprop_loopy_cg.m
% Same as cg1, except we assume all discretes are observed,
% and use loopy for approximate inference.
ns = 2*ones(1,9);
F = 1; W = 2; E = 3; B = 4; C = 5; D = 6; Min = 7; Mout = 8; L = 9;
n = 9;
dno