head.h

一个聚类算法用K-mean处理后迭代

#ifndef head_h
#define head_h

#include <vector>
#include <deque>
#include <fstream>

struct cluster {
	std::vector<double> f2;
	std::vector<double> f1;
	int n;
};

struct lable_instance {
	int lable;
	std::vector<double> att;
};

typedef std::vector < std::vector<cluster> > concept;

typedef std::vector <double> instance;

void k_means(int num_k, std::vector<instance> & v_list, std::vector<cluster> & k_cluster);

concept learn( int num_class, int num_k,
			  std::deque<lable_instance>::iterator begin, std::deque<lable_instance>::iterator end);

void split(std::deque<lable_instance>::iterator begin, std::deque<lable_instance>::iterator end,
		   std::vector< std::vector<instance> > &class_vector) ;

double accuracy( std::deque<lable_instance>::iterator begin, std::deque<lable_instance>::iterator end,
				concept & my_concept);

double distance( instance& a, instance & b);

void readfile(std::ifstream & in, std::deque <lable_instance> & d_list, int num_att, int num_instance);

#endif //head_h