kmeanscluster.h

k均值聚类的算法

// KMeansCluster.h: interface for the CKMeansCluster class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_KMEANSCLUSTER_H__3EE75D55_624B_445F_B689_7ED08204F821__INCLUDED_)
#define AFX_KMEANSCLUSTER_H__3EE75D55_624B_445F_B689_7ED08204F821__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#include "DataStructure.h"

class CKMeansCluster  
{
public:
	CKMeansCluster(int IterationNum, int ClusterNum, map<int, FeatureVector>& FeatureNode, char* OutputFileName);
	virtual ~CKMeansCluster();

private:
	double ComputeDistance(FeatureVector& Vect1, FeatureVector& Vect2);
	void KMeans(int IterationNum, int ClusterNum, map<int, FeatureVector>& FeatureNode, char* OutputFileName);
	void AdjustCentroid(int IterationNum, vector<FeatureVector>& Centroid, map<int, FeatureVector>& FeatureNode);
	// this function will return the total distance
	double GetNewCluster(int IterationTime, vector<FeatureVector>& Centroid, map<int, Cluster>& ClusterSet, map<int, FeatureVector>& FeatureNode);
	void WriteToFile(char* FileName, vector<FeatureVector>& Centroid, map<int, FeatureVector>& FeatureNode);
};

#endif // !defined(AFX_KMEANSCLUSTER_H__3EE75D55_624B_445F_B689_7ED08204F821__INCLUDED_)