灰色邓氏关联度分析
% P12 -- The Study on the Grey Relational Degree and Its Application function r1 = gld_deng(x)
s = size(x);
len = s(2);
num = s(1);
ro = 0.5;
for i = 1: num
x(i,:) = x(i,:)./x(i,1);
end
dx(num,len) = 0;
for i = 2 : num
for k = 1 : len
dx(i,k) = abs(x(1,k) - x(i,k));
end
end
max_dx = max(max(dx));
min_dx = min(min(dx));
r(1,1:len-1) = 1;
for i = 2 : num
for k = 1 : len
r(i,k) = (min_dx + ro*max_dx)/(dx(i,k) + ro*max_dx);
end
end
r1 = sum(r(2:num,:),2)/(len);
改进灰色绝对关联度分析
% P11 -- The Study on the Grey Relational Degree and Its Application function r1 = gld_gjjd(x)
s = size(x);
len = s(2);
num = s(1);
for i = 1: num
x(i,:) = x(i,:)./x(i,1);
end
dx(num,len-1) = 0;
for i = 1 : num
for j = 1 : len - 1
dx(i,j) = x(i,j+1) - x(i,j);
end
end
c = 1;
beta(1,1:len-1) = 0;
w(1,1:len-1) = 0;
for i = 2 : num
temp = sum(abs(x(i,:) - x(1,:)),2);
for k = 1 : len - 1
beta(i,k) = atan((dx(i,k) - dx(1,k))/(1 + dx(i,k)*dx(1,k)));
if beta(i,k) < 0
beta(i,k) = pi + beta(i,k);