test.cpp

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

#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#include <sstream>
#include "head.h"
#include <string>
using namespace std;

void main()
{
	ifstream in("input");

	deque < lable_instance > d_list;

/*	istringstream mystring;

	string line;

	

	int i, num_att=34; 
	lable_instance tmp;
	tmp.att.assign(num_att);

	while (getline(in, line)) {

		//read to d_list
		if(line.empty()) continue;
		mystring.str(line);
		for(i=0; i<34; i++) {
			mystring>>tmp.att[i];
		}
		mystring>>tmp.lable;
		mystring.clear();
		d_list.push_back(tmp);

	}
*/

	readfile(in, d_list, 34, 10000);

	//cout<<d_list.size()<<endl;
	//cout<<d_list[14].att[1];
	concept cc;

	cc=learn(2, 4, d_list.begin(), d_list.end());

	cout<<"accuracy:\n";
	cout<<accuracy(d_list.begin()+10000, d_list.begin()+10100, cc)<<endl;

}