datastructure.h

k均值聚类的算法

#ifndef _DATASTRUCTURE
#define _DATASTRUCTURE

#include <iostream>
#include <map>
#include <vector>
#include <string>
#include <math.h>

using namespace std;

struct ScoreError
{
	double Score;
	int Error;
};

struct DistanceToCentroid
{
	int FeatureId;
	double Distance;
};

typedef map<int, double> FeatureVector;

typedef map<int, ScoreError> CountScore;

typedef vector<FeatureVector> Cluster;

typedef vector<int> ClusterID;


#endif