bestpos.m

来自「greedy em 混和模型训练算法」· M 代码 · 共 34 行

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%% Find the best position for partitioning sequences    %%%%%
%%%%%% belong in this node of tree                          %%%%%
%%%%%%                                                      %%%%%
%%%%%% Kostas Blekas, 19 Dec. 2001                          %%%%%
%%%%%% please contact at [e-mail] in case of problems %%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%


function [r,deg] = bestpos(XI,ni,W,thres)

for i=1:ni
    st = XI(i,:);
    k1 = 0;
    for j = 1:ni
        k1 = k1 + 1.0 - size(find(st==XI(j,:)),2)/W;
    end
    b(i) = k1;
end

[min1,ind] = min(b);

r = ind;

deg = 0;

for i=1:ni
    dist(i) = 1.0 - size(find(XI(r,:)==XI(i,:)),2)/W;
end

if (size(find(dist<thres),2)==ni)
    deg = 1;
end