zuidazuixiao.cpp

模式识别----模式识别中最大最小距离算法例子源码

#include<iostream.h>
#include<iostream>
#include<math.h>
const int N=10;
void main(void)
{
	int center[20];
	float s[2][N]={{0,3,2,1,5,4,6,5,6,7},{0,8,2,1,3,8,3,4,4,5}};
	float D[20][N],theshold,theta=0.5,D12=0.0,tmp=0,min[N];
	int minindex[N],clas[N],index=0,i,k=0,j,l;
	center[0]=0;
	for(j=0;j<N;j++)
	{
		tmp=(s[0][j]-s[0][0])*(s[0][j]-s[0][0])+(s[1][j]-s[1][0])*(s[1][j]-s[1][0]);
		D[0][j]=(float)sqrt(tmp);
		cout<<D[0][j]<<" ";
		if(D[0][j]>D12){D12=D[0][j];index=j;}
	}
	cout<<"\n";
	center[1]=index;
	k=1;
	index=0;
	theshold=D12;
	while(theshold>theta*D12){
		for(j=0;j<N;j++){
			tmp=(s[0][j]-s[0][center[k]])*(s[0][j]-s[0][center[k]])+(s[1][j]-s[1][center[k]])*(s[1][j]-s[1][center[k]]);
			D[k][j]=(float)sqrt(tmp);
		}
		for(j=0;j<N;j++){
			tmp=D12;
			for(l=0;l<=k;l++)
				if(D[l][j]<tmp){tmp=D[l][j];index=l;};
			min[j]=tmp;minindex[j]=index;
		}
		float max=0;index=0;
		for(j=0;j<N;j++)
			if(min[j]>max){max=min[j];index=j;}
		if(max>theta*D12){k++;center[k]=index;}
		theshold=max;
	}
	for(j=0;j<N;j++) clas[j]=minindex[j];
	for(i=0;i<2;i++)
	{
		for(j=0;j<N;j++) cout<<s[i][j]<<" ";cout<<"\n";
	}
	cout<<"k="<<k+1<<" ";
	cout<<"center(s):";
	for(l=0;l<k;l++)cout<<center[l]+1<<"--";cout<<center[k]+1;
	cout<<"\n";
	for(j=0;j<N;j++) cout<<clas[j]+1<<" ";cout<<"\n";
}