bpa1=[0.05 0.05 0 0.1 0.8];
bpa2=[0 0 1 0 0];
%求交集和并集
A={[2,3,4],[7],[1,2,3,4,5],[1:1:20],'o'};
[n,m]=size(A);
for i=1:m
[n1(i),m1(i)]=size(A{1,i});
end
for i=1:m
j=i+1;
D(i,i)=1;
while j<=m
k=0;
for p=1:m1(i)
for q=1:m1(j)
if A{1,i}(p)==A{1,j}(q)
k=k+1;
end
end
end
D(i,j)=k/(m1(i)+m1(j)-k);
D(j,i)=k/(m1(i)+m1(j)-k);
j=j+1;
end
end
%求距离
d12=0;d11=0; d22=0;
for i=1:m;
for j=1:m
d12=d12+bpa1(i)*bpa2(j)*D(i,j);
d11=d11+bpa1(i)*bpa1(j)*D(i,j);
d22=d22+bpa2(i)*bpa2(j)*D(i,j);
end
end
d=sqrt((0.5)*(d11+d22-2*d12));
广义证据距离代码
最新推荐文章于 2024-10-17 20:48:57 发布