fid=fopen('kNNSolution46.txt','wt');
A=load('test4.ascii');
for i=1:size(A,1);
R=[0 0 0 0 0 0];
N=[0 0 0 0 0 0];
M=[0 0 0 0 0 0 0 0 0 0];
[s,countR]=size(R);
fprintf([num2str(i) '\n']);
a=A(i,:);
for j=1:size(training,1);
b=training(j,:);
c=corr2(a,b);
m=1;
while c<R(m)&m<countR
m=m+1;
end
if m<(countR-1)
u=countR-m;
for n=1:u
R(countR+1-u)=R(countR-u);
%R(n)=c;
N(countR+1-u)=N(countR-u);
%N(n)=j;
end
R(m)=c;
N(m)=label(j);
end
end
for p=1:countR
q=N(p);
M(q+1)=M(q+1)+1;
end
[r,t]=max(M);
fprintf(fid, '%d\n', t-1);
end
fclose(fid);
评论0