/****************************************************************************
*???????????????????????????????????????????????????????????????????????????*
*??CURE?????????????????????????????????????????????????????????????????????*
*???????????????????????????????????????????????????????????????????????????*
*****************************************************************************/

#include?
#include?
#include?
#include?
#include?
#include?

#define?????????SUCCESS?????????1
#define?????????FAILURE?????????0
#define?????????TRUE????????????1
#define?????????FALSE???????????0
#define?????????NUMPATTERNS?????10???//?數(shù)據(jù)點(diǎn)的個(gè)數(shù)
#define?????????SIZEVECTOR??????2?????//?數(shù)據(jù)集的維數(shù)
#define?????????NUMCLUSTERS?????2?????//?類的個(gè)數(shù)
#define?????????NUMPRE??????????3????//?代表點(diǎn)個(gè)數(shù)
#define?????????SHRINK??????????0.5???//?收縮率

//?*****?定義結(jié)構(gòu)和類?*****
struct?ClustNode?{
	int??????????Member[NUMPATTERNS];??//類中的數(shù)據(jù)項(xiàng)
	int??????????NumMembers;
	double???????Means[SIZEVECTOR];??//均值點(diǎn)
	double???????Pre[NUMPRE][SIZEVECTOR];//代表點(diǎn)
	int??????????PreMember[NUMPRE];//作為代表點(diǎn)的數(shù)據(jù)項(xiàng)
	int??????????closet;??//最近的簇
	double???????MinDist;//與最近的簇之間的距離
};

class?System?{
private:
	double??????Pattern[NUMPATTERNS][SIZEVECTOR];
	ClustNode?*p[NUMPATTERNS];
????void????????BuildClustList（）;?//建立初始簇鏈表
	ClustNode?*?Merge（ClustNode?*ClustNode?*）;?//合并兩個(gè)簇
	int?????????MinClust（）;????//找到最近的兩個(gè)簇
	double??????dist（ClustNode*ClustNode?*）;//兩個(gè)簇之間的最短距離
	double??????EucNorm（double?*double?*）;//代表點(diǎn)之間的距離
	void????????ShrinkPre（ClustNode?*）;??//收縮代表點(diǎn)

public:
	System（）;
	~System（）;
	int?LoadPatterns（char?*fname）;??????//?處理數(shù)據(jù)集
	void?RunCure（）;?????????????????????//?聚類的過(guò)程
	void?ShowClusters（）;????????????????//?顯示聚類結(jié)果
};
System::System（）
{
}
System::~System（）
{
	int?i;
	for（i=0;i		if（p[i]==NULL）
			continue;
		else
			delete?p[i];
	}
}
int?System::LoadPatterns（char?*fname）{
	int????ijlen;
	char?buff[300];
	char?*ptr*ptr1;
	ifstream?infile（fnameios::in）;????//將fname打開(kāi)作為輸入
	if（!infile）{
		cout<<“不能打開(kāi)輸入文件:\n“;
		return?FAILURE;
	}
	for（i=0;?i		infile.getline（buff300）;?????//將300個(gè)字符傳入buff中，buff是指針
		len=0;
		ptr=buff;
		for?（j=0;?j			ptr1=strchr（ptr‘‘）;???//找出sptr指向的字符串中第一次出現(xiàn)““的位置
			*ptr1=‘\0‘;
			Pattern[i][j]=atof（ptr）;????//將ptr指向的字符串轉(zhuǎn)化為浮點(diǎn)數(shù)
			len=strlen（ptr）;
			ptr=ptr+len+1;
		}?/*?endfor?*/
	}?/*?endfor?*/
	infile.close（）;
	return?SUCCESS;
}
void??System::BuildClustList（）{
	int?ij;
	double?MinDistd;
	for（i=0;i		p[i]=new?ClustNode;
		p[i]->NumMembers=1;
		p[i]->Member[0]=i;
		p[i]->PreMember[0]=i;
		for（j=0;j			p[i]->Means[j]=Pattern[i][j];//均值
		}
		for（j=0;j			p[i]->Pre[0][j]=Pattern[i][j]+（SHRINK）*（p[i]->Means[j]-Pattern[i][j]）;//計(jì)算代表點(diǎn)
		}
	}
	for（i=0;i		p[i]->MinDist=9.9e+99;
		for（j=0;j